/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/count_up_down-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:59:28,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:59:28,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:59:28,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:59:28,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:59:28,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:59:28,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:59:28,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:59:28,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:59:28,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:59:28,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:59:28,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:59:28,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:59:28,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:59:28,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:59:28,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:59:28,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:59:28,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:59:28,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:59:28,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:59:28,301 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:59:28,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:59:28,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:59:28,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:59:28,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:59:28,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:59:28,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:59:28,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:59:28,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:59:28,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:59:28,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:59:28,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:59:28,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:59:28,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:59:28,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:59:28,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:59:28,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:59:28,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:59:28,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:59:28,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:59:28,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:59:28,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:59:28,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 08:59:28,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:59:28,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:59:28,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:59:28,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:59:28,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:59:28,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:59:28,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:59:28,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:59:28,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:59:28,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:59:28,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:59:28,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:59:28,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:59:28,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:59:28,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:59:28,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:28,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:59:28,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:59:28,328 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:59:28,328 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:59:28,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:59:28,328 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 08:59:28,329 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 08:59:28,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:59:28,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:59:28,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:59:28,608 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:59:28,609 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:59:28,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down-1.c [2022-04-08 08:59:28,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350542677/d2f99511d5344699b7315719a0b97188/FLAG9729c7f92 [2022-04-08 08:59:29,079 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:59:29,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c [2022-04-08 08:59:29,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350542677/d2f99511d5344699b7315719a0b97188/FLAG9729c7f92 [2022-04-08 08:59:29,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350542677/d2f99511d5344699b7315719a0b97188 [2022-04-08 08:59:29,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:59:29,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:59:29,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:29,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:59:29,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:59:29,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc79f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29, skipping insertion in model container [2022-04-08 08:59:29,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:59:29,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:59:29,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c[327,340] [2022-04-08 08:59:29,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:29,700 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:59:29,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c[327,340] [2022-04-08 08:59:29,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:29,727 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:59:29,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29 WrapperNode [2022-04-08 08:59:29,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:29,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:59:29,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:59:29,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:59:29,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:59:29,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:59:29,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:59:29,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:59:29,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (1/1) ... [2022-04-08 08:59:29,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:29,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:29,809 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-08 08:59:29,842 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-08 08:59:29,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:59:29,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:59:29,875 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:59:29,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 08:59:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:59:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:59:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:59:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:59:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:59:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 08:59:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 08:59:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:59:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:59:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:59:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:59:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:59:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:59:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:59:29,937 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:59:29,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:59:30,101 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:59:30,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:59:30,107 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:59:30,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:30 BoogieIcfgContainer [2022-04-08 08:59:30,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:59:30,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:59:30,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:59:30,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:59:30,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:59:29" (1/3) ... [2022-04-08 08:59:30,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48287861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:30, skipping insertion in model container [2022-04-08 08:59:30,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:29" (2/3) ... [2022-04-08 08:59:30,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48287861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:30, skipping insertion in model container [2022-04-08 08:59:30,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:30" (3/3) ... [2022-04-08 08:59:30,132 INFO L111 eAbstractionObserver]: Analyzing ICFG count_up_down-1.c [2022-04-08 08:59:30,136 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:59:30,136 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:59:30,212 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:59:30,220 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:59:30,221 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:59:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 08:59:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 08:59:30,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:30,253 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:30,253 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:30,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1301225826, now seen corresponding path program 1 times [2022-04-08 08:59:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917795158] [2022-04-08 08:59:30,280 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:59:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1301225826, now seen corresponding path program 2 times [2022-04-08 08:59:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:30,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749650447] [2022-04-08 08:59:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:30,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-08 08:59:30,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 08:59:30,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-08 08:59:30,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:30,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-08 08:59:30,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-08 08:59:30,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-08 08:59:30,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret7 := main(); {21#true} is VALID [2022-04-08 08:59:30,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {26#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 08:59:30,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {27#(and (= main_~y~0 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 08:59:30,708 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#(and (= main_~y~0 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 08:59:30,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 08:59:30,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22#false} is VALID [2022-04-08 08:59:30,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-08 08:59:30,710 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-08 08:59:30,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:30,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749650447] [2022-04-08 08:59:30,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749650447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:30,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:30,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:59:30,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:30,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1917795158] [2022-04-08 08:59:30,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1917795158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:30,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:30,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:59:30,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451489658] [2022-04-08 08:59:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 08:59:30,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:30,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:30,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:30,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:59:30,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:59:30,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:59:30,767 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:31,153 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-08 08:59:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:59:31,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 08:59:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-08 08:59:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-08 08:59:31,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-08 08:59:31,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:31,220 INFO L225 Difference]: With dead ends: 37 [2022-04-08 08:59:31,220 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 08:59:31,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:59:31,225 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:31,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 08:59:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 08:59:31,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:31,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,247 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,247 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:31,250 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 08:59:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 08:59:31,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:31,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:31,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-08 08:59:31,251 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-08 08:59:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:31,254 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 08:59:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 08:59:31,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:31,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:31,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:31,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 08:59:31,258 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 08:59:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:31,258 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 08:59:31,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:31,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 08:59:31,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 08:59:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 08:59:31,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:31,273 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:31,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:59:31,274 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:31,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1718713523, now seen corresponding path program 1 times [2022-04-08 08:59:31,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:31,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432717867] [2022-04-08 08:59:31,290 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 08:59:31,290 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1718713523, now seen corresponding path program 2 times [2022-04-08 08:59:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:31,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900655820] [2022-04-08 08:59:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:31,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:31,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-08 08:59:31,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-08 08:59:31,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #36#return; {169#true} is VALID [2022-04-08 08:59:31,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:31,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-08 08:59:31,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-08 08:59:31,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #36#return; {169#true} is VALID [2022-04-08 08:59:31,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret7 := main(); {169#true} is VALID [2022-04-08 08:59:31,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {174#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 08:59:31,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {174#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {175#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 08:59:31,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {176#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 08:59:31,557 INFO L272 TraceCheckUtils]: 8: Hoare triple {176#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 08:59:31,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {178#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 08:59:31,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {178#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {170#false} is VALID [2022-04-08 08:59:31,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-08 08:59:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:31,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:31,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900655820] [2022-04-08 08:59:31,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900655820] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:31,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859085276] [2022-04-08 08:59:31,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:31,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:31,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:31,562 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-08 08:59:31,566 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-08 08:59:31,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:31,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:31,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 08:59:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:31,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:32,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-08 08:59:32,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#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(18, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-08 08:59:32,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-08 08:59:32,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #36#return; {169#true} is VALID [2022-04-08 08:59:32,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret7 := main(); {169#true} is VALID [2022-04-08 08:59:32,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {174#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 08:59:32,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {174#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {201#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-08 08:59:32,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1) (< 0 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {205#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 08:59:32,063 INFO L272 TraceCheckUtils]: 8: Hoare triple {205#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {209#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:59:32,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {213#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:59:32,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {170#false} is VALID [2022-04-08 08:59:32,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-08 08:59:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:32,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:32,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-08 08:59:32,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {170#false} is VALID [2022-04-08 08:59:32,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {213#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:59:32,457 INFO L272 TraceCheckUtils]: 8: Hoare triple {176#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {209#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:59:32,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {176#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 08:59:32,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {232#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 08:59:32,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {236#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 08:59:32,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret7 := main(); {169#true} is VALID [2022-04-08 08:59:32,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #36#return; {169#true} is VALID [2022-04-08 08:59:32,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-08 08:59:32,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#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(18, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-08 08:59:32,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2022-04-08 08:59:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:32,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859085276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:32,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:32,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-08 08:59:32,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:32,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432717867] [2022-04-08 08:59:32,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432717867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:32,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:32,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:59:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381175588] [2022-04-08 08:59:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:32,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:59:32,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:32,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:32,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:59:32,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:59:32,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:59:32,488 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:32,656 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-08 08:59:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:59:32,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:59:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2022-04-08 08:59:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2022-04-08 08:59:32,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 19 transitions. [2022-04-08 08:59:32,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:32,690 INFO L225 Difference]: With dead ends: 19 [2022-04-08 08:59:32,690 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 08:59:32,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-08 08:59:32,692 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:32,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 08:59:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 08:59:32,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:32,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,701 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,702 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:32,709 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 08:59:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 08:59:32,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:32,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:32,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 08:59:32,710 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 08:59:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:32,713 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 08:59:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 08:59:32,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:32,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:32,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:32,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 08:59:32,721 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-08 08:59:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:32,721 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 08:59:32,721 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:32,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 08:59:32,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 08:59:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 08:59:32,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:32,737 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:32,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 08:59:32,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:32,938 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1775930242, now seen corresponding path program 3 times [2022-04-08 08:59:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:32,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1087147218] [2022-04-08 08:59:32,942 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 08:59:32,942 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:32,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1775930242, now seen corresponding path program 4 times [2022-04-08 08:59:32,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:32,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455789149] [2022-04-08 08:59:32,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:32,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:33,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-08 08:59:33,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 08:59:33,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} #36#return; {361#true} is VALID [2022-04-08 08:59:33,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:33,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-08 08:59:33,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 08:59:33,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #36#return; {361#true} is VALID [2022-04-08 08:59:33,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret7 := main(); {361#true} is VALID [2022-04-08 08:59:33,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {366#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 08:59:33,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {367#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 08:59:33,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {367#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {368#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 08:59:33,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {369#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 08:59:33,260 INFO L272 TraceCheckUtils]: 9: Hoare triple {369#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 08:59:33,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {370#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {371#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 08:59:33,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {362#false} is VALID [2022-04-08 08:59:33,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-08 08:59:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:33,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:33,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455789149] [2022-04-08 08:59:33,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455789149] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:33,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658382791] [2022-04-08 08:59:33,263 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:59:33,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:33,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:33,264 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-08 08:59:33,274 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-08 08:59:33,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:59:33,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:33,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 08:59:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:33,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:54,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-08 08:59:54,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#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(18, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-08 08:59:54,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 08:59:54,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #36#return; {361#true} is VALID [2022-04-08 08:59:54,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret7 := main(); {361#true} is VALID [2022-04-08 08:59:54,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {366#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 08:59:54,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {367#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 08:59:54,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {367#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {397#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 08:59:54,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !(~x~0 % 4294967296 > 0); {401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< (* 2 (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296))) (+ (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 1)))} is VALID [2022-04-08 08:59:54,110 INFO L272 TraceCheckUtils]: 9: Hoare triple {401#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< (* 2 (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296))) (+ (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 1)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {405#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:59:54,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {405#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {409#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:59:54,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {409#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {362#false} is VALID [2022-04-08 08:59:54,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-08 08:59:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:54,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:54,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-08 08:59:54,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {409#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {362#false} is VALID [2022-04-08 08:59:54,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {405#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {409#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:59:54,803 INFO L272 TraceCheckUtils]: 9: Hoare triple {369#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {405#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:59:54,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {369#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 08:59:54,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {432#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {428#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 08:59:54,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {436#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {432#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 08:59:54,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {436#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 08:59:54,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret7 := main(); {361#true} is VALID [2022-04-08 08:59:54,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #36#return; {361#true} is VALID [2022-04-08 08:59:54,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-08 08:59:54,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#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(18, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-08 08:59:54,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-08 08:59:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:54,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658382791] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:54,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:59:54,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 08:59:54,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:54,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1087147218] [2022-04-08 08:59:54,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1087147218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:54,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:54,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:59:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9452581] [2022-04-08 08:59:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:54,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 08:59:54,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:54,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:54,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:54,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:59:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:54,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:59:54,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-08 08:59:54,848 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:55,113 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 08:59:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 08:59:55,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 08:59:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-08 08:59:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-08 08:59:55,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2022-04-08 08:59:55,157 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-08 08:59:55,158 INFO L225 Difference]: With dead ends: 20 [2022-04-08 08:59:55,158 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 08:59:55,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-04-08 08:59:55,160 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:55,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:59:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 08:59:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 08:59:55,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:55,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,169 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,169 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:55,170 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 08:59:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 08:59:55,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:55,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:55,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 08:59:55,171 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 08:59:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:55,172 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 08:59:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 08:59:55,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:55,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:55,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:55,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 08:59:55,174 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 08:59:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:55,174 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 08:59:55,174 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:59:55,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 08:59:55,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 08:59:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 08:59:55,197 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:55,197 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:55,202 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-08 08:59:55,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 08:59:55,400 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:55,400 INFO L85 PathProgramCache]: Analyzing trace with hash -745318765, now seen corresponding path program 5 times [2022-04-08 08:59:55,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:55,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [681215009] [2022-04-08 08:59:55,407 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 08:59:55,407 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash -745318765, now seen corresponding path program 6 times [2022-04-08 08:59:55,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:55,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742757110] [2022-04-08 08:59:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:55,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:59:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:55,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {569#true} is VALID [2022-04-08 08:59:55,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 08:59:55,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {569#true} {569#true} #36#return; {569#true} is VALID [2022-04-08 08:59:55,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {569#true} call ULTIMATE.init(); {581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:59:55,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {569#true} is VALID [2022-04-08 08:59:55,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 08:59:55,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} #36#return; {569#true} is VALID [2022-04-08 08:59:55,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {569#true} call #t~ret7 := main(); {569#true} is VALID [2022-04-08 08:59:55,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {574#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 08:59:55,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {574#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {575#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 08:59:55,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {575#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {576#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-08 08:59:55,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {577#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 08:59:55,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {577#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {578#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 08:59:55,885 INFO L272 TraceCheckUtils]: 10: Hoare triple {578#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {579#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 08:59:55,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {579#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {580#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 08:59:55,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {580#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {570#false} is VALID [2022-04-08 08:59:55,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {570#false} assume !false; {570#false} is VALID [2022-04-08 08:59:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:59:55,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742757110] [2022-04-08 08:59:55,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742757110] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:59:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965303093] [2022-04-08 08:59:55,888 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:59:55,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:55,892 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-08 08:59:55,896 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-08 08:59:55,934 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 08:59:55,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:55,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 08:59:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:55,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:18,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {569#true} call ULTIMATE.init(); {569#true} is VALID [2022-04-08 09:00:18,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#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(18, 2);call #Ultimate.allocInit(12, 3); {569#true} is VALID [2022-04-08 09:00:18,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 09:00:18,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} #36#return; {569#true} is VALID [2022-04-08 09:00:18,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {569#true} call #t~ret7 := main(); {569#true} is VALID [2022-04-08 09:00:18,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {574#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 09:00:18,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {574#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {575#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 09:00:18,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {575#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {576#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-08 09:00:18,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {609#(and (<= main_~y~0 3) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 09:00:18,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {609#(and (<= main_~y~0 3) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {613#(and (<= main_~y~0 3) (<= 3 main_~y~0) (< (div (+ (* main_~y~0 (- 4294967295)) (* (- 1) main_~n~0)) (- 4294967296)) (+ main_~y~0 1 (div (+ (* (- 1) (div (+ main_~n~0 4294967296 (* (- 1) main_~y~0)) (- 4294967296))) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) 2))))} is VALID [2022-04-08 09:00:18,297 INFO L272 TraceCheckUtils]: 10: Hoare triple {613#(and (<= main_~y~0 3) (<= 3 main_~y~0) (< (div (+ (* main_~y~0 (- 4294967295)) (* (- 1) main_~n~0)) (- 4294967296)) (+ main_~y~0 1 (div (+ (* (- 1) (div (+ main_~n~0 4294967296 (* (- 1) main_~y~0)) (- 4294967296))) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) 2))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:18,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:18,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {570#false} is VALID [2022-04-08 09:00:18,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {570#false} assume !false; {570#false} is VALID [2022-04-08 09:00:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:18,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:18,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {570#false} assume !false; {570#false} is VALID [2022-04-08 09:00:18,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {570#false} is VALID [2022-04-08 09:00:18,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:18,942 INFO L272 TraceCheckUtils]: 10: Hoare triple {578#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:18,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {640#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {578#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 09:00:18,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {644#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {640#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 09:00:18,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {648#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {644#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 09:00:18,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {652#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {648#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 09:00:18,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {652#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 09:00:18,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {569#true} call #t~ret7 := main(); {569#true} is VALID [2022-04-08 09:00:18,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {569#true} {569#true} #36#return; {569#true} is VALID [2022-04-08 09:00:18,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {569#true} assume true; {569#true} is VALID [2022-04-08 09:00:18,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#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(18, 2);call #Ultimate.allocInit(12, 3); {569#true} is VALID [2022-04-08 09:00:18,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {569#true} call ULTIMATE.init(); {569#true} is VALID [2022-04-08 09:00:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:18,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965303093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:18,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:18,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 09:00:18,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:18,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [681215009] [2022-04-08 09:00:18,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [681215009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:18,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:18,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:00:18,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076140337] [2022-04-08 09:00:18,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:18,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:00:18,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:18,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:19,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:00:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:00:19,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:00:19,102 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:19,461 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-08 09:00:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:00:19,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:00:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-08 09:00:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-08 09:00:19,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 21 transitions. [2022-04-08 09:00:19,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:19,505 INFO L225 Difference]: With dead ends: 21 [2022-04-08 09:00:19,505 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 09:00:19,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2022-04-08 09:00:19,508 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:19,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 09:00:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 09:00:19,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:19,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,526 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,526 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:19,527 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:00:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:00:19,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:19,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:19,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 09:00:19,528 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 09:00:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:19,529 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:00:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:00:19,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:19,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:19,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:19,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 09:00:19,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-08 09:00:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:19,531 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 09:00:19,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:19,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 09:00:19,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:00:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:00:19,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:19,576 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:19,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 09:00:19,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:19,777 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1594626654, now seen corresponding path program 7 times [2022-04-08 09:00:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:19,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [807900024] [2022-04-08 09:00:19,780 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:19,780 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1594626654, now seen corresponding path program 8 times [2022-04-08 09:00:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:19,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031855552] [2022-04-08 09:00:19,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:19,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:20,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {793#true} is VALID [2022-04-08 09:00:20,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {793#true} assume true; {793#true} is VALID [2022-04-08 09:00:20,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {793#true} {793#true} #36#return; {793#true} is VALID [2022-04-08 09:00:20,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {793#true} call ULTIMATE.init(); {806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:20,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {793#true} is VALID [2022-04-08 09:00:20,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {793#true} assume true; {793#true} is VALID [2022-04-08 09:00:20,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {793#true} {793#true} #36#return; {793#true} is VALID [2022-04-08 09:00:20,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {793#true} call #t~ret7 := main(); {793#true} is VALID [2022-04-08 09:00:20,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {798#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 09:00:20,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {798#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {799#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 09:00:20,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {799#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {800#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-08 09:00:20,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {801#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 09:00:20,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {802#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 09:00:20,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {802#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {803#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 09:00:20,168 INFO L272 TraceCheckUtils]: 11: Hoare triple {803#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {804#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:00:20,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {804#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {805#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:00:20,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {794#false} is VALID [2022-04-08 09:00:20,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {794#false} assume !false; {794#false} is VALID [2022-04-08 09:00:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:20,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:20,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031855552] [2022-04-08 09:00:20,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031855552] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:20,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043368447] [2022-04-08 09:00:20,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:20,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:20,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:20,171 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-08 09:00:20,172 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-08 09:00:20,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:20,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:20,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 09:00:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:20,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:01:15,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {793#true} call ULTIMATE.init(); {793#true} is VALID [2022-04-08 09:01:15,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {793#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(18, 2);call #Ultimate.allocInit(12, 3); {793#true} is VALID [2022-04-08 09:01:15,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {793#true} assume true; {793#true} is VALID [2022-04-08 09:01:15,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {793#true} {793#true} #36#return; {793#true} is VALID [2022-04-08 09:01:15,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {793#true} call #t~ret7 := main(); {793#true} is VALID [2022-04-08 09:01:15,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {798#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 09:01:15,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {798#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {799#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 09:01:15,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {799#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {800#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-08 09:01:15,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {801#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 09:01:15,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {837#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 09:01:15,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {837#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {841#(and (<= main_~y~0 4) (<= (div (+ (* main_~y~0 (- 4294967295)) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (- 3)) 4294967296) main_~y~0)) (< 0 (+ (div (+ (div (+ main_~n~0 (- 4)) 4294967296) (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296)) 2) (div (+ main_~y~0 (- 4)) 4294967296) (div (+ main_~y~0 4294967294 (* (- 1) main_~n~0)) 4294967296) 1)))} is VALID [2022-04-08 09:01:16,071 INFO L272 TraceCheckUtils]: 11: Hoare triple {841#(and (<= main_~y~0 4) (<= (div (+ (* main_~y~0 (- 4294967295)) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (- 3)) 4294967296) main_~y~0)) (< 0 (+ (div (+ (div (+ main_~n~0 (- 4)) 4294967296) (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296)) 2) (div (+ main_~y~0 (- 4)) 4294967296) (div (+ main_~y~0 4294967294 (* (- 1) main_~n~0)) 4294967296) 1)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {845#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:01:16,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {849#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:16,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {794#false} is VALID [2022-04-08 09:01:16,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {794#false} assume !false; {794#false} is VALID [2022-04-08 09:01:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:16,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:01:16,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {794#false} assume !false; {794#false} is VALID [2022-04-08 09:01:16,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {794#false} is VALID [2022-04-08 09:01:16,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {849#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:01:16,916 INFO L272 TraceCheckUtils]: 11: Hoare triple {803#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {845#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:01:16,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {868#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {803#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 09:01:16,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {868#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 09:01:16,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {876#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {872#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 09:01:16,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {880#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {876#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 09:01:16,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {884#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {880#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 09:01:16,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {884#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 09:01:16,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {793#true} call #t~ret7 := main(); {793#true} is VALID [2022-04-08 09:01:16,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {793#true} {793#true} #36#return; {793#true} is VALID [2022-04-08 09:01:16,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {793#true} assume true; {793#true} is VALID [2022-04-08 09:01:16,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {793#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(18, 2);call #Ultimate.allocInit(12, 3); {793#true} is VALID [2022-04-08 09:01:16,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {793#true} call ULTIMATE.init(); {793#true} is VALID [2022-04-08 09:01:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:16,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043368447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:01:16,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:01:16,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 09:01:16,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:01:16,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [807900024] [2022-04-08 09:01:16,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [807900024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:01:16,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:01:16,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:01:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142179041] [2022-04-08 09:01:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:01:16,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:01:16,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:01:16,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:16,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:16,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:01:16,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:16,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:01:16,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:01:16,955 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:17,637 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:01:17,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:01:17,638 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:01:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:01:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2022-04-08 09:01:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2022-04-08 09:01:17,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 22 transitions. [2022-04-08 09:01:17,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:17,686 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:01:17,686 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:01:17,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2022-04-08 09:01:17,688 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:01:17,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:01:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:01:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:01:17,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:01:17,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:17,705 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:17,706 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:17,708 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:01:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:01:17,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:17,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:17,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:01:17,709 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:01:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:01:17,711 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:01:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:01:17,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:01:17,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:01:17,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:01:17,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:01:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 09:01:17,714 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-08 09:01:17,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:01:17,714 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 09:01:17,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:01:17,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 09:01:17,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:01:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:01:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:01:17,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:01:17,883 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:01:17,899 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-08 09:01:18,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:18,084 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:01:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:01:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2141599859, now seen corresponding path program 9 times [2022-04-08 09:01:18,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:01:18,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1004598014] [2022-04-08 09:01:18,088 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:01:18,088 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:01:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2141599859, now seen corresponding path program 10 times [2022-04-08 09:01:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:01:18,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083591496] [2022-04-08 09:01:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:01:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:01:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:18,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:01:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:18,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {1047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1033#true} is VALID [2022-04-08 09:01:18,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-08 09:01:18,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1033#true} {1033#true} #36#return; {1033#true} is VALID [2022-04-08 09:01:18,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:01:18,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1033#true} is VALID [2022-04-08 09:01:18,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-08 09:01:18,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #36#return; {1033#true} is VALID [2022-04-08 09:01:18,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret7 := main(); {1033#true} is VALID [2022-04-08 09:01:18,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {1038#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 09:01:18,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1039#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 09:01:18,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {1039#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1040#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-08 09:01:18,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {1040#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1041#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 09:01:18,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {1041#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1042#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-08 09:01:18,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1043#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 09:01:18,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {1044#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 09:01:18,511 INFO L272 TraceCheckUtils]: 12: Hoare triple {1044#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1045#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:01:18,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1046#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:01:18,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {1046#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1034#false} is VALID [2022-04-08 09:01:18,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-08 09:01:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:01:18,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:01:18,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083591496] [2022-04-08 09:01:18,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083591496] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:01:18,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602907715] [2022-04-08 09:01:18,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:01:18,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:01:18,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:01:18,515 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-08 09:01:18,517 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-08 09:01:18,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:01:18,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:01:18,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 09:01:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:01:18,611 INFO L286 TraceCheckSpWp]: Computing forward predicates...