/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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:34:37,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:34:37,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:34:37,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:34:37,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:34:37,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:34:37,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:34:37,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:34:37,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:34:37,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:34:37,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:34:37,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:34:37,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:34:37,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:34:37,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:34:37,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:34:37,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:34:37,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:34:37,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:34:37,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:34:37,269 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:34:37,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:34:37,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:34:37,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:34:37,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:34:37,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:34:37,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:34:37,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:34:37,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:34:37,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:34:37,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:34:37,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:34:37,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:34:37,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:34:37,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:34:37,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:34:37,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:34:37,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:34:37,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:34:37,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:34:37,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:34:37,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:34:37,284 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:34:37,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:34:37,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:34:37,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:34:37,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:34:37,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:34:37,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:34:37,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:34:37,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:34:37,305 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:34:37,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:34:37,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:34:37,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:34:37,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:34:37,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:34:37,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:34:37,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:34:37,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:34:37,306 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:34:37,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:34:37,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:34:37,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:34:37,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:34:37,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:34:37,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:34:37,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:34:37,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:34:37,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:34:37,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:34:37,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:34:37,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:34:37,309 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:34:37,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:34:37,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:34:37,309 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:34:37,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:34:37,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:34:37,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:34:37,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:34:37,540 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:34:37,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound20.c [2022-04-27 13:34:37,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13bcda8f/3526d1394e86445ab8ff41206f261f60/FLAG1a2218571 [2022-04-27 13:34:37,932 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:34:37,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound20.c [2022-04-27 13:34:37,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13bcda8f/3526d1394e86445ab8ff41206f261f60/FLAG1a2218571 [2022-04-27 13:34:37,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13bcda8f/3526d1394e86445ab8ff41206f261f60 [2022-04-27 13:34:37,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:34:37,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:34:37,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:34:37,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:34:37,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:34:37,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:34:37" (1/1) ... [2022-04-27 13:34:37,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba5b506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:37, skipping insertion in model container [2022-04-27 13:34:37,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:34:37" (1/1) ... [2022-04-27 13:34:37,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:34:37,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:34:38,138 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_unwindbound20.c[537,550] [2022-04-27 13:34:38,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:34:38,175 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:34:38,186 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_unwindbound20.c[537,550] [2022-04-27 13:34:38,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:34:38,209 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:34:38,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38 WrapperNode [2022-04-27 13:34:38,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:34:38,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:34:38,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:34:38,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:34:38,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38" (1/1) ... [2022-04-27 13:34:38,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38" (1/1) ... [2022-04-27 13:34:38,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38" (1/1) ... [2022-04-27 13:34:38,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38" (1/1) ... [2022-04-27 13:34:38,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38" (1/1) ... [2022-04-27 13:34:38,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38" (1/1) ... [2022-04-27 13:34:38,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38" (1/1) ... [2022-04-27 13:34:38,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:34:38,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:34:38,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:34:38,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:34:38,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38" (1/1) ... [2022-04-27 13:34:38,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:34:38,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:34:38,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:34:38,282 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:34:38,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:34:38,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:34:38,304 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:34:38,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:34:38,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:34:38,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:34:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:34:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:34:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:34:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:34:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:34:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:34:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:34:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:34:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:34:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:34:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:34:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:34:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:34:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:34:38,351 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:34:38,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:34:38,481 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:34:38,485 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:34:38,486 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:34:38,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:34:38 BoogieIcfgContainer [2022-04-27 13:34:38,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:34:38,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:34:38,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:34:38,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:34:38,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:34:37" (1/3) ... [2022-04-27 13:34:38,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db72fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:34:38, skipping insertion in model container [2022-04-27 13:34:38,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:34:38" (2/3) ... [2022-04-27 13:34:38,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db72fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:34:38, skipping insertion in model container [2022-04-27 13:34:38,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:34:38" (3/3) ... [2022-04-27 13:34:38,503 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound20.c [2022-04-27 13:34:38,512 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:34:38,512 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:34:38,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:34:38,560 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@5254fd4b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4bb025a2 [2022-04-27 13:34:38,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:34:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:34:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:34:38,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:34:38,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:34:38,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:34:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:34:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-27 13:34:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:34:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156435874] [2022-04-27 13:34:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:34:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:34:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:38,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:34:38,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:34:38,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:34:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:34:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:38,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:34:38,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:34:38,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:34:38,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:34:38,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:34:38,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:34:38,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:34:38,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:34:38,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-27 13:34:38,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-27 13:34:38,763 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-27 13:34:38,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:34:38,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:34:38,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:34:38,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:34:38,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-27 13:34:38,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:34:38,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:34:38,764 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-27 13:34:38,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:34:38,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:34:38,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:34:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:34:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:34:38,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156435874] [2022-04-27 13:34:38,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156435874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:34:38,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:34:38,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:34:38,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664518679] [2022-04-27 13:34:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:34:38,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:34:38,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:34:38,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:38,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:38,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:34:38,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:34:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:34:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:34:38,832 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:39,014 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-27 13:34:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:34:39,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:34:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:34:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:34:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:34:39,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 13:34:39,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:39,186 INFO L225 Difference]: With dead ends: 66 [2022-04-27 13:34:39,186 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:34:39,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:34:39,192 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:34:39,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:34:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:34:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 13:34:39,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:34:39,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:39,218 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:39,218 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:39,232 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:34:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:34:39,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:39,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:39,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:34:39,235 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:34:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:39,241 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:34:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:34:39,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:39,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:39,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:34:39,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:34:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 13:34:39,246 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-27 13:34:39,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:34:39,246 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 13:34:39,246 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 13:34:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:34:39,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:34:39,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:34:39,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:34:39,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:34:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:34:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-27 13:34:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:34:39,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836464153] [2022-04-27 13:34:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:34:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:39,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:34:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:39,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:34:39,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:34:39,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:34:39,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:34:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:39,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:34:39,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:34:39,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:34:39,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:34:39,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:34:39,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:34:39,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:34:39,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:34:39,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret8 := main(); {256#true} is VALID [2022-04-27 13:34:39,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#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;~B~0 := #t~nondet5;havoc #t~nondet5; {256#true} is VALID [2022-04-27 13:34:39,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-27 13:34:39,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:34:39,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:34:39,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:34:39,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:34:39,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:34:39,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:34:39,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} assume !!(#t~post6 < 20);havoc #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:34:39,384 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:34:39,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:34:39,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:34:39,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:34:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:34:39,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:34:39,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836464153] [2022-04-27 13:34:39,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836464153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:34:39,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:34:39,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:34:39,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013781263] [2022-04-27 13:34:39,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:34:39,391 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:34:39,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:34:39,391 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:39,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:39,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:34:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:34:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:34:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:34:39,406 INFO L87 Difference]: Start difference. First operand 32 states and 42 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:39,726 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:34:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:34:39,726 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:34:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:34:39,727 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:34:39,729 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:34:39,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:34:39,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:39,784 INFO L225 Difference]: With dead ends: 47 [2022-04-27 13:34:39,784 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 13:34:39,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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:34:39,785 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:34:39,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:34:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 13:34:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-27 13:34:39,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:34:39,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:39,790 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:39,790 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:39,793 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:34:39,793 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:34:39,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:39,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:39,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:34:39,798 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:34:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:39,800 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:34:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:34:39,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:39,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:39,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:34:39,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:34:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 13:34:39,803 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-27 13:34:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:34:39,803 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 13:34:39,803 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:34:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 13:34:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:34:39,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:34:39,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:34:39,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:34:39,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:34:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:34:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-27 13:34:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:34:39,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240144892] [2022-04-27 13:34:39,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:34:39,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:34:39,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473455123] [2022-04-27 13:34:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:39,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:34:39,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:34:39,821 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:34:39,822 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:34:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:39,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:34:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:39,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:34:40,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-27 13:34:40,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#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);~counter~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} #96#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} call #t~ret8 := main(); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(<= ~counter~0 0)} 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;~B~0 := #t~nondet5;havoc #t~nondet5; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,041 INFO L272 TraceCheckUtils]: 6: Hoare triple {497#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} ~cond := #in~cond; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} assume !(0 == ~cond); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} #80#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:40,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {531#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:34:40,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {490#false} is VALID [2022-04-27 13:34:40,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {490#false} is VALID [2022-04-27 13:34:40,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !(#t~post7 < 20);havoc #t~post7; {490#false} is VALID [2022-04-27 13:34:40,044 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {490#false} is VALID [2022-04-27 13:34:40,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-27 13:34:40,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-27 13:34:40,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-27 13:34:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:34:40,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:34:40,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:34:40,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240144892] [2022-04-27 13:34:40,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:34:40,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473455123] [2022-04-27 13:34:40,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473455123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:34:40,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:34:40,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:34:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336878051] [2022-04-27 13:34:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:34:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:34:40,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:34:40,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:34:40,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:40,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:34:40,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:34:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:34:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:34:40,059 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:34:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:40,142 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-27 13:34:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:34:40,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:34:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:34:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:34:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:34:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:34:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:34:40,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-27 13:34:40,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:40,234 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:34:40,234 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 13:34:40,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:34:40,237 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:34:40,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:34:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 13:34:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 13:34:40,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:34:40,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:40,251 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:40,252 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:40,253 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:34:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:34:40,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:40,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:40,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:34:40,254 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:34:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:40,256 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:34:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:34:40,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:40,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:40,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:34:40,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:34:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-27 13:34:40,258 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-27 13:34:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:34:40,258 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-27 13:34:40,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:34:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:34:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:34:40,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:34:40,262 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:34:40,283 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:34:40,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:34:40,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:34:40,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:34:40,472 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-27 13:34:40,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:34:40,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695947313] [2022-04-27 13:34:40,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:40,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:34:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:34:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:40,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:34:40,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:34:40,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:34:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:34:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:40,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:34:40,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:34:40,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:34:40,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:34:40,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 13:34:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:40,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:34:40,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:34:40,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:34:40,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:34:40,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:34:40,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:34:40,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:34:40,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:34:40,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret8 := main(); {757#true} is VALID [2022-04-27 13:34:40,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#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;~B~0 := #t~nondet5;havoc #t~nondet5; {757#true} is VALID [2022-04-27 13:34:40,554 INFO L272 TraceCheckUtils]: 6: Hoare triple {757#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {757#true} is VALID [2022-04-27 13:34:40,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:34:40,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:34:40,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:34:40,554 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:34:40,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:34:40,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:34:40,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 20);havoc #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:34:40,560 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {757#true} is VALID [2022-04-27 13:34:40,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:34:40,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:34:40,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:34:40,561 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:34:40,562 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:34:40,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {771#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {772#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:34:40,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {758#false} is VALID [2022-04-27 13:34:40,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-27 13:34:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:34:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:34:40,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695947313] [2022-04-27 13:34:40,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695947313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:34:40,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:34:40,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:34:40,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423820106] [2022-04-27 13:34:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:34:40,566 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:34:40,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:34:40,566 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:34:40,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:40,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:34:40,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:34:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:34:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:34:40,584 INFO L87 Difference]: Start difference. First operand 38 states and 47 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:34:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:40,888 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:34:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:34:40,888 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:34:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:34:40,888 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:34:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:34:40,890 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:34:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:34:40,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:34:40,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:40,970 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:34:40,970 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:34:40,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 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:34:40,971 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:34:40,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:34:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:34:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-27 13:34:40,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:34:40,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:40,980 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:40,980 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:40,982 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:34:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:34:40,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:40,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:40,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:34:40,983 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:34:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:40,985 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:34:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:34:40,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:40,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:40,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:34:40,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:34:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:34:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 13:34:40,988 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-27 13:34:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:34:40,989 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 13:34:40,989 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:34:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 13:34:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:34:40,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:34:40,990 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:34:40,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:34:40,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:34:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:34:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-27 13:34:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:34:40,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474020529] [2022-04-27 13:34:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:34:41,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:34:41,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134975850] [2022-04-27 13:34:41,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:41,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:34:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:34:41,002 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:34:41,003 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:34:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:41,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:34:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:41,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:34:41,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2022-04-27 13:34:41,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {1018#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);~counter~0 := 0; {1018#true} is VALID [2022-04-27 13:34:41,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:34:41,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #96#return; {1018#true} is VALID [2022-04-27 13:34:41,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2022-04-27 13:34:41,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#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;~B~0 := #t~nondet5;havoc #t~nondet5; {1018#true} is VALID [2022-04-27 13:34:41,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {1018#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:34:41,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:34:41,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:34:41,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:34:41,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} #80#return; {1018#true} is VALID [2022-04-27 13:34:41,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:41,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:41,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:41,163 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:34:41,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:34:41,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:34:41,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:34:41,174 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:41,174 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(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)); {1018#true} is VALID [2022-04-27 13:34:41,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:34:41,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:34:41,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:34:41,175 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:41,176 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(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)); {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:34:41,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:34:41,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1019#false} is VALID [2022-04-27 13:34:41,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2022-04-27 13:34:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:34:41,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:34:41,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:34:41,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474020529] [2022-04-27 13:34:41,177 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:34:41,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134975850] [2022-04-27 13:34:41,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134975850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:34:41,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:34:41,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:34:41,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785647534] [2022-04-27 13:34:41,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:34:41,178 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:34:41,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:34:41,178 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:34:41,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:41,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:34:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:34:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:34:41,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:34:41,200 INFO L87 Difference]: Start difference. First operand 42 states and 50 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:34:43,343 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:34:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:43,531 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-27 13:34:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:34:43,531 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:34:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:34:43,532 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:34:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:34:43,533 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:34:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:34:43,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 13:34:43,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:43,592 INFO L225 Difference]: With dead ends: 59 [2022-04-27 13:34:43,592 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:34:43,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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:34:43,592 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:34:43,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 13:34:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:34:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:34:43,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:34:43,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:34:43,601 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:34:43,601 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:34:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:43,603 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:34:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:34:43,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:43,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:43,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:34:43,604 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:34:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:43,606 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:34:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:34:43,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:43,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:43,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:34:43,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:34:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:34:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-27 13:34:43,608 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-27 13:34:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:34:43,608 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-27 13:34:43,608 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:34:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:34:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:34:43,609 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:34:43,609 INFO L195 NwaCegarLoop]: trace histogram [4, 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:34:43,627 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:34:43,823 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:34:43,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:34:43,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:34:43,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-27 13:34:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:34:43,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221654361] [2022-04-27 13:34:43,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:43,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:34:43,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:34:43,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91699758] [2022-04-27 13:34:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:43,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:34:43,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:34:43,844 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:34:43,845 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:34:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:43,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:34:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:43,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:34:44,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2022-04-27 13:34:44,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#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);~counter~0 := 0; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1394#(<= ~counter~0 0)} {1386#true} #96#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {1394#(<= ~counter~0 0)} call #t~ret8 := main(); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#(<= ~counter~0 0)} 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;~B~0 := #t~nondet5;havoc #t~nondet5; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,062 INFO L272 TraceCheckUtils]: 6: Hoare triple {1394#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#(<= ~counter~0 0)} ~cond := #in~cond; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#(<= ~counter~0 0)} assume !(0 == ~cond); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1394#(<= ~counter~0 0)} {1394#(<= ~counter~0 0)} #80#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:44,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {1394#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {1428#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,065 INFO L272 TraceCheckUtils]: 14: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,066 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #82#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,067 INFO L272 TraceCheckUtils]: 19: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,068 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #84#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,069 INFO L272 TraceCheckUtils]: 24: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,070 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #86#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {1428#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:44,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {1428#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1483#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:34:44,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {1483#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1387#false} is VALID [2022-04-27 13:34:44,071 INFO L272 TraceCheckUtils]: 32: Hoare triple {1387#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1387#false} is VALID [2022-04-27 13:34:44,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {1387#false} ~cond := #in~cond; {1387#false} is VALID [2022-04-27 13:34:44,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {1387#false} assume 0 == ~cond; {1387#false} is VALID [2022-04-27 13:34:44,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2022-04-27 13:34:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:34:44,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:34:44,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:34:44,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221654361] [2022-04-27 13:34:44,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:34:44,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91699758] [2022-04-27 13:34:44,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91699758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:34:44,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:34:44,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:34:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914632281] [2022-04-27 13:34:44,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:34:44,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:34:44,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:34:44,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:34:44,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:44,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:34:44,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:34:44,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:34:44,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:34:44,099 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:34:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:44,270 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-27 13:34:44,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:34:44,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:34:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:34:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:34:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:34:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:34:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:34:44,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:34:44,320 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:34:44,321 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:34:44,321 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 13:34:44,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:34:44,322 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:34:44,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:34:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 13:34:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 13:34:44,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:34:44,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:34:44,336 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:34:44,336 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:34:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:44,338 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:34:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:34:44,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:44,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:44,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:34:44,339 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:34:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:44,345 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:34:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:34:44,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:44,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:44,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:34:44,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:34:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:34:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-27 13:34:44,347 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-27 13:34:44,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:34:44,348 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-27 13:34:44,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:34:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-27 13:34:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:34:44,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:34:44,349 INFO L195 NwaCegarLoop]: trace histogram [4, 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:34:44,381 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:34:44,559 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:34:44,560 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:34:44,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:34:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-27 13:34:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:34:44,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438221163] [2022-04-27 13:34:44,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:44,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:34:44,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:34:44,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474140479] [2022-04-27 13:34:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:44,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:34:44,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:34:44,574 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:34:44,574 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:34:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:44,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:34:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:44,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:34:45,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {1839#true} call ULTIMATE.init(); {1839#true} is VALID [2022-04-27 13:34:45,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1839#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);~counter~0 := 0; {1839#true} is VALID [2022-04-27 13:34:45,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:34:45,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#true} {1839#true} #96#return; {1839#true} is VALID [2022-04-27 13:34:45,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#true} call #t~ret8 := main(); {1839#true} is VALID [2022-04-27 13:34:45,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#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;~B~0 := #t~nondet5;havoc #t~nondet5; {1839#true} is VALID [2022-04-27 13:34:45,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:34:45,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:34:45,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:34:45,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:34:45,134 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1839#true} {1839#true} #80#return; {1839#true} is VALID [2022-04-27 13:34:45,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:34:45,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:34:45,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 20);havoc #t~post6; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:34:45,136 INFO L272 TraceCheckUtils]: 14: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:34:45,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:34:45,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:34:45,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:34:45,139 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:34:45,139 INFO L272 TraceCheckUtils]: 19: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:34:45,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:34:45,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:34:45,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:34:45,140 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:34:45,140 INFO L272 TraceCheckUtils]: 24: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:34:45,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:34:45,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:34:45,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:34:45,141 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:34:45,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:34:45,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:34:45,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:34:45,145 INFO L272 TraceCheckUtils]: 32: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~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)); {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:34:45,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:34:45,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1840#false} is VALID [2022-04-27 13:34:45,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {1840#false} assume !false; {1840#false} is VALID [2022-04-27 13:34:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:34:45,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:34:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:34:45,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438221163] [2022-04-27 13:34:45,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:34:45,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474140479] [2022-04-27 13:34:45,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474140479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:34:45,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:34:45,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:34:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319938311] [2022-04-27 13:34:45,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:34:45,147 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, (7), 2 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 36 [2022-04-27 13:34:45,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:34:45,148 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, (7), 2 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:34:45,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:45,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:34:45,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:34:45,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:34:45,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:34:45,171 INFO L87 Difference]: Start difference. First operand 68 states and 79 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, (7), 2 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:34:49,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 13:34:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:49,905 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-27 13:34:49,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:34:49,905 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, (7), 2 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 36 [2022-04-27 13:34:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:34:49,906 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, (7), 2 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:34:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:34:49,907 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, (7), 2 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:34:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:34:49,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 13:34:49,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:49,982 INFO L225 Difference]: With dead ends: 82 [2022-04-27 13:34:49,982 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 13:34:49,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:34:49,983 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:34:49,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 13:34:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 13:34:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-27 13:34:50,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:34:50,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:34:50,001 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:34:50,001 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:34:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:50,003 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:34:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:34:50,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:50,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:50,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-27 13:34:50,004 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-27 13:34:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:50,007 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:34:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:34:50,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:50,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:50,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:34:50,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:34:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:34:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-27 13:34:50,011 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-27 13:34:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:34:50,011 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-27 13:34:50,011 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, (7), 2 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:34:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-27 13:34:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:34:50,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:34:50,012 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1] [2022-04-27 13:34:50,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 13:34:50,227 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:34:50,227 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:34:50,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:34:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-27 13:34:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:34:50,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7698174] [2022-04-27 13:34:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:50,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:34:50,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:34:50,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055489719] [2022-04-27 13:34:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:50,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:34:50,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:34:50,251 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:34:50,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:34:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:50,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:34:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:50,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:34:50,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:34:50,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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);~counter~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2346#(<= ~counter~0 0)} {2338#true} #96#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {2346#(<= ~counter~0 0)} call #t~ret8 := main(); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {2346#(<= ~counter~0 0)} 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;~B~0 := #t~nondet5;havoc #t~nondet5; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,482 INFO L272 TraceCheckUtils]: 6: Hoare triple {2346#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {2346#(<= ~counter~0 0)} ~cond := #in~cond; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {2346#(<= ~counter~0 0)} assume !(0 == ~cond); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(<= ~counter~0 0)} {2346#(<= ~counter~0 0)} #80#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:34:50,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {2346#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,485 INFO L272 TraceCheckUtils]: 14: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,487 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #82#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,488 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,489 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #84#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,490 INFO L272 TraceCheckUtils]: 24: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,492 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #86#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {2380#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:34:50,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {2380#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2435#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:34:50,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {2435#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:34:50,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:34:50,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 20);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:34:50,494 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:34:50,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:34:50,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:34:50,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:34:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:34:50,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:34:50,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:34:50,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:34:50,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:34:50,727 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:34:50,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 20);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:34:50,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:34:50,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {2475#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:34:50,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {2479#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2475#(< |main_#t~post6| 20)} is VALID [2022-04-27 13:34:50,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {2479#(< ~counter~0 20)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2479#(< ~counter~0 20)} is VALID [2022-04-27 13:34:50,730 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2479#(< ~counter~0 20)} #86#return; {2479#(< ~counter~0 20)} is VALID [2022-04-27 13:34:50,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:34:50,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:34:50,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:34:50,731 INFO L272 TraceCheckUtils]: 24: Hoare triple {2479#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:34:50,734 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2338#true} {2479#(< ~counter~0 20)} #84#return; {2479#(< ~counter~0 20)} is VALID [2022-04-27 13:34:50,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:34:50,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:34:50,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:34:50,734 INFO L272 TraceCheckUtils]: 19: Hoare triple {2479#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:34:50,735 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2338#true} {2479#(< ~counter~0 20)} #82#return; {2479#(< ~counter~0 20)} is VALID [2022-04-27 13:34:50,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:34:50,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:34:50,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:34:50,735 INFO L272 TraceCheckUtils]: 14: Hoare triple {2479#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:34:50,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {2479#(< ~counter~0 20)} is VALID [2022-04-27 13:34:50,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2479#(< ~counter~0 20)} is VALID [2022-04-27 13:34:50,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {2534#(< ~counter~0 19)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2534#(< ~counter~0 19)} is VALID [2022-04-27 13:34:50,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2338#true} {2534#(< ~counter~0 19)} #80#return; {2534#(< ~counter~0 19)} is VALID [2022-04-27 13:34:50,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:34:50,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:34:50,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:34:50,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {2534#(< ~counter~0 19)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:34:50,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {2534#(< ~counter~0 19)} 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;~B~0 := #t~nondet5;havoc #t~nondet5; {2534#(< ~counter~0 19)} is VALID [2022-04-27 13:34:50,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {2534#(< ~counter~0 19)} call #t~ret8 := main(); {2534#(< ~counter~0 19)} is VALID [2022-04-27 13:34:50,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2534#(< ~counter~0 19)} {2338#true} #96#return; {2534#(< ~counter~0 19)} is VALID [2022-04-27 13:34:50,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {2534#(< ~counter~0 19)} assume true; {2534#(< ~counter~0 19)} is VALID [2022-04-27 13:34:50,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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);~counter~0 := 0; {2534#(< ~counter~0 19)} is VALID [2022-04-27 13:34:50,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:34:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:34:50,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:34:50,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7698174] [2022-04-27 13:34:50,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:34:50,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055489719] [2022-04-27 13:34:50,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055489719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:34:50,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:34:50,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:34:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386243129] [2022-04-27 13:34:50,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:34:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:34:50,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:34:50,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:34:50,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:50,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:34:50,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:34:50,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:34:50,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:34:50,785 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:34:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:51,206 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-04-27 13:34:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:34:51,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:34:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:34:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:34:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:34:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:34:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:34:51,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-04-27 13:34:51,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:51,328 INFO L225 Difference]: With dead ends: 160 [2022-04-27 13:34:51,328 INFO L226 Difference]: Without dead ends: 146 [2022-04-27 13:34:51,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:34:51,329 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:34:51,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 180 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:34:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-27 13:34:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-04-27 13:34:51,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:34:51,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:34:51,370 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:34:51,370 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:34:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:51,373 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-27 13:34:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-27 13:34:51,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:51,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:51,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-27 13:34:51,374 INFO L87 Difference]: Start difference. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-27 13:34:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:34:51,377 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-27 13:34:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-27 13:34:51,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:34:51,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:34:51,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:34:51,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:34:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:34:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2022-04-27 13:34:51,381 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 38 [2022-04-27 13:34:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:34:51,381 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2022-04-27 13:34:51,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:34:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-04-27 13:34:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 13:34:51,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:34:51,382 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:34:51,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:34:51,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:34:51,599 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:34:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:34:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-27 13:34:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:34:51,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417936460] [2022-04-27 13:34:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:34:51,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:34:51,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337820071] [2022-04-27 13:34:51,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:34:51,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:34:51,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:34:51,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:34:51,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:34:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:51,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 13:34:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:34:51,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:34:52,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2022-04-27 13:34:52,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#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);~counter~0 := 0; {3284#true} is VALID [2022-04-27 13:34:52,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:52,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #96#return; {3284#true} is VALID [2022-04-27 13:34:52,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret8 := main(); {3284#true} is VALID [2022-04-27 13:34:52,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#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;~B~0 := #t~nondet5;havoc #t~nondet5; {3284#true} is VALID [2022-04-27 13:34:52,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:34:52,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} ~cond := #in~cond; {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:34:52,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:34:52,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:34:52,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} {3284#true} #80#return; {3321#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:34:52,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {3321#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:52,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:52,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:52,595 INFO L272 TraceCheckUtils]: 14: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:34:52,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:52,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:52,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:52,596 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:52,596 INFO L272 TraceCheckUtils]: 19: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:34:52,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:52,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:52,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:52,597 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:52,597 INFO L272 TraceCheckUtils]: 24: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= 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)); {3284#true} is VALID [2022-04-27 13:34:52,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:52,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:52,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:52,598 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:34:52,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= 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; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:34:52,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:34:52,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 20);havoc #t~post6; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:34:52,600 INFO L272 TraceCheckUtils]: 32: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:34:52,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:52,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:52,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:52,600 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:34:52,600 INFO L272 TraceCheckUtils]: 37: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:34:52,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:52,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:52,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:52,601 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:34:52,607 INFO L272 TraceCheckUtils]: 42: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:34:52,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:34:52,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3285#false} is VALID [2022-04-27 13:34:52,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2022-04-27 13:34:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:34:52,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:34:52,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2022-04-27 13:34:52,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3285#false} is VALID [2022-04-27 13:34:52,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:34:52,977 INFO L272 TraceCheckUtils]: 42: Hoare triple {3440#(= (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)); {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:34:52,977 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #84#return; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:34:52,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:52,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:52,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:52,978 INFO L272 TraceCheckUtils]: 37: Hoare triple {3440#(= (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)); {3284#true} is VALID [2022-04-27 13:34:52,978 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:34:52,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:52,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:52,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:52,978 INFO L272 TraceCheckUtils]: 32: Hoare triple {3440#(= (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)); {3284#true} is VALID [2022-04-27 13:34:52,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !!(#t~post6 < 20);havoc #t~post6; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:34:52,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:34:54,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {3480#(= (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; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:34:54,442 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #86#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:34:54,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:54,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:54,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:54,443 INFO L272 TraceCheckUtils]: 24: Hoare triple {3480#(= (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)); {3284#true} is VALID [2022-04-27 13:34:54,443 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:34:54,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:54,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:54,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:54,444 INFO L272 TraceCheckUtils]: 19: Hoare triple {3480#(= (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)); {3284#true} is VALID [2022-04-27 13:34:54,444 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:34:54,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:54,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:54,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:54,444 INFO L272 TraceCheckUtils]: 14: Hoare triple {3480#(= (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)); {3284#true} is VALID [2022-04-27 13:34:54,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(#t~post6 < 20);havoc #t~post6; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:34:54,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:34:54,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:34:54,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3284#true} {3284#true} #80#return; {3284#true} is VALID [2022-04-27 13:34:54,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:54,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:34:54,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:34:54,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:34:54,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#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;~B~0 := #t~nondet5;havoc #t~nondet5; {3284#true} is VALID [2022-04-27 13:34:54,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret8 := main(); {3284#true} is VALID [2022-04-27 13:34:54,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #96#return; {3284#true} is VALID [2022-04-27 13:34:54,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:34:54,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#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);~counter~0 := 0; {3284#true} is VALID [2022-04-27 13:34:54,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2022-04-27 13:34:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:34:54,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:34:54,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417936460] [2022-04-27 13:34:54,447 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:34:54,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337820071] [2022-04-27 13:34:54,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337820071] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:34:54,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:34:54,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:34:54,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380621593] [2022-04-27 13:34:54,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:34:54,448 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-27 13:34:54,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:34:54,448 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:34:56,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:34:56,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:34:56,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:34:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:34:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:34:56,489 INFO L87 Difference]: Start difference. First operand 138 states and 166 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:34:59,767 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:35:02,082 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:35:04,215 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:35:06,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:35:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:35:07,399 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2022-04-27 13:35:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:35:07,399 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-27 13:35:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:35:07,400 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:35:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:35:07,400 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:35:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:35:07,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:35:09,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:35:09,462 INFO L225 Difference]: With dead ends: 162 [2022-04-27 13:35:09,462 INFO L226 Difference]: Without dead ends: 160 [2022-04-27 13:35:09,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 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:35:09,463 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 132 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.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:35:09,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 132 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 8.6s Time] [2022-04-27 13:35:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-27 13:35:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2022-04-27 13:35:09,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:35:09,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:35:09,504 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:35:09,504 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:35:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:35:09,507 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-27 13:35:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-27 13:35:09,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:35:09,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:35:09,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-27 13:35:09,508 INFO L87 Difference]: Start difference. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-27 13:35:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:35:09,513 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-27 13:35:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-27 13:35:09,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:35:09,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:35:09,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:35:09,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:35:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:35:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2022-04-27 13:35:09,516 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 46 [2022-04-27 13:35:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:35:09,516 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2022-04-27 13:35:09,517 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:35:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2022-04-27 13:35:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:35:09,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:35:09,517 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1] [2022-04-27 13:35:09,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:35:09,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:35:09,721 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:35:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:35:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-04-27 13:35:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:35:09,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211643412] [2022-04-27 13:35:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:35:09,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:35:09,739 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:35:09,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465681480] [2022-04-27 13:35:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:35:09,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:35:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:35:09,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:35:09,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 13:35:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:35:09,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:35:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:35:09,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:35:10,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} call ULTIMATE.init(); {4334#true} is VALID [2022-04-27 13:35:10,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#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);~counter~0 := 0; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {4342#(<= ~counter~0 0)} assume true; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4342#(<= ~counter~0 0)} {4334#true} #96#return; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {4342#(<= ~counter~0 0)} call #t~ret8 := main(); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {4342#(<= ~counter~0 0)} 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;~B~0 := #t~nondet5;havoc #t~nondet5; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {4342#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {4342#(<= ~counter~0 0)} ~cond := #in~cond; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {4342#(<= ~counter~0 0)} assume !(0 == ~cond); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {4342#(<= ~counter~0 0)} assume true; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4342#(<= ~counter~0 0)} {4342#(<= ~counter~0 0)} #80#return; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {4342#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:35:10,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {4342#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {4376#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,033 INFO L272 TraceCheckUtils]: 14: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,034 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #82#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,035 INFO L272 TraceCheckUtils]: 19: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,036 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #84#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,036 INFO L272 TraceCheckUtils]: 24: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,038 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #86#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {4376#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:35:10,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {4376#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {4431#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,039 INFO L272 TraceCheckUtils]: 32: Hoare triple {4431#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {4431#(<= ~counter~0 2)} ~cond := #in~cond; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {4431#(<= ~counter~0 2)} assume !(0 == ~cond); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {4431#(<= ~counter~0 2)} assume true; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,040 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} #88#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,041 INFO L272 TraceCheckUtils]: 37: Hoare triple {4431#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {4431#(<= ~counter~0 2)} ~cond := #in~cond; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {4431#(<= ~counter~0 2)} assume !(0 == ~cond); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {4431#(<= ~counter~0 2)} assume true; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,046 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} #90#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,047 INFO L290 TraceCheckUtils]: 42: Hoare triple {4431#(<= ~counter~0 2)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,047 INFO L290 TraceCheckUtils]: 43: Hoare triple {4431#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:35:10,047 INFO L290 TraceCheckUtils]: 44: Hoare triple {4431#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4474#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:35:10,048 INFO L290 TraceCheckUtils]: 45: Hoare triple {4474#(<= |main_#t~post7| 2)} assume !(#t~post7 < 20);havoc #t~post7; {4335#false} is VALID [2022-04-27 13:35:10,048 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {4335#false} is VALID [2022-04-27 13:35:10,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} ~cond := #in~cond; {4335#false} is VALID [2022-04-27 13:35:10,048 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} assume 0 == ~cond; {4335#false} is VALID [2022-04-27 13:35:10,048 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} assume !false; {4335#false} is VALID [2022-04-27 13:35:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:35:10,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:35:10,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} assume !false; {4335#false} is VALID [2022-04-27 13:35:10,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} assume 0 == ~cond; {4335#false} is VALID [2022-04-27 13:35:10,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} ~cond := #in~cond; {4335#false} is VALID [2022-04-27 13:35:10,274 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {4335#false} is VALID [2022-04-27 13:35:10,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {4502#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {4335#false} is VALID [2022-04-27 13:35:10,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {4506#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4502#(< |main_#t~post7| 20)} is VALID [2022-04-27 13:35:10,275 INFO L290 TraceCheckUtils]: 43: Hoare triple {4506#(< ~counter~0 20)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4506#(< ~counter~0 20)} is VALID [2022-04-27 13:35:10,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {4506#(< ~counter~0 20)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {4506#(< ~counter~0 20)} is VALID [2022-04-27 13:35:10,276 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4334#true} {4506#(< ~counter~0 20)} #90#return; {4506#(< ~counter~0 20)} is VALID [2022-04-27 13:35:10,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:35:10,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:35:10,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:35:10,276 INFO L272 TraceCheckUtils]: 37: Hoare triple {4506#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:35:10,277 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4334#true} {4506#(< ~counter~0 20)} #88#return; {4506#(< ~counter~0 20)} is VALID [2022-04-27 13:35:10,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:35:10,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:35:10,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:35:10,277 INFO L272 TraceCheckUtils]: 32: Hoare triple {4506#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:35:10,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {4506#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {4506#(< ~counter~0 20)} is VALID [2022-04-27 13:35:10,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {4549#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4506#(< ~counter~0 20)} is VALID [2022-04-27 13:35:10,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {4549#(< ~counter~0 19)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {4549#(< ~counter~0 19)} is VALID [2022-04-27 13:35:10,279 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4334#true} {4549#(< ~counter~0 19)} #86#return; {4549#(< ~counter~0 19)} is VALID [2022-04-27 13:35:10,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:35:10,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:35:10,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:35:10,279 INFO L272 TraceCheckUtils]: 24: Hoare triple {4549#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:35:10,280 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4334#true} {4549#(< ~counter~0 19)} #84#return; {4549#(< ~counter~0 19)} is VALID [2022-04-27 13:35:10,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:35:10,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:35:10,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:35:10,280 INFO L272 TraceCheckUtils]: 19: Hoare triple {4549#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:35:10,280 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4334#true} {4549#(< ~counter~0 19)} #82#return; {4549#(< ~counter~0 19)} is VALID [2022-04-27 13:35:10,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:35:10,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:35:10,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:35:10,281 INFO L272 TraceCheckUtils]: 14: Hoare triple {4549#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:35:10,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {4549#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {4549#(< ~counter~0 19)} is VALID [2022-04-27 13:35:10,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {4604#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4549#(< ~counter~0 19)} is VALID [2022-04-27 13:35:10,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {4604#(< ~counter~0 18)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4604#(< ~counter~0 18)} is VALID [2022-04-27 13:35:10,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4334#true} {4604#(< ~counter~0 18)} #80#return; {4604#(< ~counter~0 18)} is VALID [2022-04-27 13:35:10,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:35:10,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:35:10,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:35:10,283 INFO L272 TraceCheckUtils]: 6: Hoare triple {4604#(< ~counter~0 18)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:35:10,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {4604#(< ~counter~0 18)} 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;~B~0 := #t~nondet5;havoc #t~nondet5; {4604#(< ~counter~0 18)} is VALID [2022-04-27 13:35:10,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {4604#(< ~counter~0 18)} call #t~ret8 := main(); {4604#(< ~counter~0 18)} is VALID [2022-04-27 13:35:10,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4604#(< ~counter~0 18)} {4334#true} #96#return; {4604#(< ~counter~0 18)} is VALID [2022-04-27 13:35:10,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {4604#(< ~counter~0 18)} assume true; {4604#(< ~counter~0 18)} is VALID [2022-04-27 13:35:10,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#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);~counter~0 := 0; {4604#(< ~counter~0 18)} is VALID [2022-04-27 13:35:10,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} call ULTIMATE.init(); {4334#true} is VALID [2022-04-27 13:35:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:35:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:35:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211643412] [2022-04-27 13:35:10,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:35:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465681480] [2022-04-27 13:35:10,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465681480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:35:10,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:35:10,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:35:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583350725] [2022-04-27 13:35:10,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:35:10,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 13:35:10,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:35:10,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:35:10,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:35:10,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:35:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:35:10,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:35:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:35:10,352 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:35:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:35:13,541 INFO L93 Difference]: Finished difference Result 281 states and 346 transitions. [2022-04-27 13:35:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:35:13,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 13:35:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:35:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:35:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-04-27 13:35:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:35:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-04-27 13:35:13,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2022-04-27 13:35:13,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:35:13,695 INFO L225 Difference]: With dead ends: 281 [2022-04-27 13:35:13,695 INFO L226 Difference]: Without dead ends: 257 [2022-04-27 13:35:13,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:35:13,696 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 153 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:35:13,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 228 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 13:35:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-27 13:35:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 250. [2022-04-27 13:35:13,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:35:13,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:35:13,769 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:35:13,769 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:35:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:35:13,774 INFO L93 Difference]: Finished difference Result 257 states and 309 transitions. [2022-04-27 13:35:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2022-04-27 13:35:13,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:35:13,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:35:13,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) Second operand 257 states. [2022-04-27 13:35:13,776 INFO L87 Difference]: Start difference. First operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) Second operand 257 states. [2022-04-27 13:35:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:35:13,781 INFO L93 Difference]: Finished difference Result 257 states and 309 transitions. [2022-04-27 13:35:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2022-04-27 13:35:13,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:35:13,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:35:13,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:35:13,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:35:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:35:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2022-04-27 13:35:13,789 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 50 [2022-04-27 13:35:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:35:13,789 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2022-04-27 13:35:13,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:35:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2022-04-27 13:35:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:35:13,789 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:35:13,789 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:35:13,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:35:13,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:35:13,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:35:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:35:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -397308229, now seen corresponding path program 1 times [2022-04-27 13:35:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:35:13,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864516256] [2022-04-27 13:35:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:35:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:35:14,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:35:14,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722491131] [2022-04-27 13:35:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:35:14,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:35:14,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:35:14,006 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:35:14,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process