/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/ddlm2013.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:12:37,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:12:37,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:12:37,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:12:37,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:12:37,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:12:37,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:12:37,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:12:37,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:12:37,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:12:37,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:12:37,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:12:37,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:12:37,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:12:37,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:12:37,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:12:37,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:12:37,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:12:37,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:12:37,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:12:37,842 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:12:37,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:12:37,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:12:37,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:12:37,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:12:37,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:12:37,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:12:37,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:12:37,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:12:37,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:12:37,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:12:37,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:12:37,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:12:37,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:12:37,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:12:37,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:12:37,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:12:37,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:12:37,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:12:37,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:12:37,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:12:37,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:12:37,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:12:37,876 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:12:37,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:12:37,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:12:37,877 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:12:37,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:12:37,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:12:37,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:12:37,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:12:37,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:12:37,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:12:37,878 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:12:37,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:12:37,878 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:12:37,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:12:37,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:12:37,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:12:37,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:12:37,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:12:37,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:37,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:12:37,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:12:37,880 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:12:37,880 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:12:37,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:12:37,880 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:12:37,881 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-15 06:12:38,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:12:38,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:12:38,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:12:38,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:12:38,127 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:12:38,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-04-15 06:12:38,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46129bde4/3870148740534e21b6f601aef660d2ec/FLAGee6aab2cc [2022-04-15 06:12:38,465 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:12:38,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-04-15 06:12:38,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46129bde4/3870148740534e21b6f601aef660d2ec/FLAGee6aab2cc [2022-04-15 06:12:38,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46129bde4/3870148740534e21b6f601aef660d2ec [2022-04-15 06:12:38,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:12:38,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:12:38,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:38,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:12:38,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:12:38,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:38" (1/1) ... [2022-04-15 06:12:38,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6936d88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:38, skipping insertion in model container [2022-04-15 06:12:38,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:38" (1/1) ... [2022-04-15 06:12:38,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:12:38,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:12:39,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i[895,908] [2022-04-15 06:12:39,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:39,109 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:12:39,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i[895,908] [2022-04-15 06:12:39,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:39,135 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:12:39,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39 WrapperNode [2022-04-15 06:12:39,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:39,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:12:39,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:12:39,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:12:39,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39" (1/1) ... [2022-04-15 06:12:39,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39" (1/1) ... [2022-04-15 06:12:39,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39" (1/1) ... [2022-04-15 06:12:39,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39" (1/1) ... [2022-04-15 06:12:39,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39" (1/1) ... [2022-04-15 06:12:39,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39" (1/1) ... [2022-04-15 06:12:39,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39" (1/1) ... [2022-04-15 06:12:39,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:12:39,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:12:39,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:12:39,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:12:39,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39" (1/1) ... [2022-04-15 06:12:39,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:39,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:39,192 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-15 06:12:39,194 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-15 06:12:39,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:12:39,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:12:39,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:12:39,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:12:39,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:12:39,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:12:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:12:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:12:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:12:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:12:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:12:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:12:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:12:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:12:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:12:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:12:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:12:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:12:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:12:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:12:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:12:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:12:39,283 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:12:39,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:12:39,441 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:12:39,448 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:12:39,449 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:12:39,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:39 BoogieIcfgContainer [2022-04-15 06:12:39,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:12:39,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:12:39,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:12:39,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:12:39,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:12:38" (1/3) ... [2022-04-15 06:12:39,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7c4060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:39, skipping insertion in model container [2022-04-15 06:12:39,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:39" (2/3) ... [2022-04-15 06:12:39,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7c4060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:39, skipping insertion in model container [2022-04-15 06:12:39,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:39" (3/3) ... [2022-04-15 06:12:39,457 INFO L111 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2022-04-15 06:12:39,460 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:12:39,461 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:12:39,509 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:12:39,514 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-15 06:12:39,514 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:12:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:12:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:12:39,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:39,550 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:39,550 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:39,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:39,554 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 1 times [2022-04-15 06:12:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:39,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1951746190] [2022-04-15 06:12:39,588 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 2 times [2022-04-15 06:12:39,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:39,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093690210] [2022-04-15 06:12:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:39,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:39,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26#true} is VALID [2022-04-15 06:12:39,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 06:12:39,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-15 06:12:39,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:39,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {26#true} is VALID [2022-04-15 06:12:39,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 06:12:39,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-15 06:12:39,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-15 06:12:39,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {26#true} is VALID [2022-04-15 06:12:39,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume 0 != ~flag~0;~i~0 := 0; {26#true} is VALID [2022-04-15 06:12:39,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-15 06:12:39,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 != ~flag~0; {27#false} is VALID [2022-04-15 06:12:39,763 INFO L272 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-15 06:12:39,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 06:12:39,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 06:12:39,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 06:12:39,764 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-15 06:12:39,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:39,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093690210] [2022-04-15 06:12:39,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093690210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:39,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:39,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:12:39,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:39,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1951746190] [2022-04-15 06:12:39,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1951746190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:39,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:39,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:12:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112324563] [2022-04-15 06:12:39,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:12:39,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:39,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:39,797 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-15 06:12:39,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:12:39,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:12:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:12:39,819 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:39,903 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 06:12:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:12:39,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:12:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-15 06:12:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-15 06:12:39,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-04-15 06:12:39,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:39,986 INFO L225 Difference]: With dead ends: 36 [2022-04-15 06:12:39,986 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:12:39,988 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:12:39,990 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:39,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:12:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:12:40,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:40,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,016 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,017 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:40,021 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:12:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:12:40,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:40,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:40,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:12:40,023 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:12:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:40,026 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:12:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:12:40,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:40,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:40,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:40,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 06:12:40,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-15 06:12:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:40,038 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 06:12:40,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 06:12:40,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:12:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:12:40,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:40,062 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:40,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:12:40,064 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 1 times [2022-04-15 06:12:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:40,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043658719] [2022-04-15 06:12:40,066 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 2 times [2022-04-15 06:12:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:40,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232780085] [2022-04-15 06:12:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:40,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:40,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {170#true} is VALID [2022-04-15 06:12:40,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-15 06:12:40,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #68#return; {170#true} is VALID [2022-04-15 06:12:40,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:40,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {170#true} is VALID [2022-04-15 06:12:40,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-15 06:12:40,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #68#return; {170#true} is VALID [2022-04-15 06:12:40,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret5 := main(); {170#true} is VALID [2022-04-15 06:12:40,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {170#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:40,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:40,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:40,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:40,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} assume 0 != ~flag~0; {175#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:40,253 INFO L272 TraceCheckUtils]: 10: Hoare triple {175#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {176#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:40,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {176#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {177#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:40,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {177#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {171#false} is VALID [2022-04-15 06:12:40,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {171#false} assume !false; {171#false} is VALID [2022-04-15 06:12:40,254 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-15 06:12:40,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:40,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232780085] [2022-04-15 06:12:40,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232780085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:40,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:40,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:12:40,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:40,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043658719] [2022-04-15 06:12:40,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043658719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:40,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:40,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:12:40,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415353984] [2022-04-15 06:12:40,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:40,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:12:40,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:40,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,269 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-15 06:12:40,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:12:40,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:40,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:12:40,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:12:40,270 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:40,393 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 06:12:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:12:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:12:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 06:12:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-15 06:12:40,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-15 06:12:40,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:40,426 INFO L225 Difference]: With dead ends: 24 [2022-04-15 06:12:40,426 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:12:40,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:12:40,427 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:40,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:12:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 06:12:40,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:40,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,432 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,432 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:40,433 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 06:12:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:12:40,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:40,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:40,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:12:40,434 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:12:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:40,435 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 06:12:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:12:40,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:40,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:40,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:40,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 06:12:40,436 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-15 06:12:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:40,436 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 06:12:40,437 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:40,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 06:12:40,452 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-15 06:12:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:12:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:12:40,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:40,453 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:40,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:12:40,453 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 1 times [2022-04-15 06:12:40,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:40,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1009752573] [2022-04-15 06:12:40,455 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 2 times [2022-04-15 06:12:40,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:40,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142497767] [2022-04-15 06:12:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:40,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:40,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:40,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {307#true} is VALID [2022-04-15 06:12:40,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-15 06:12:40,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-15 06:12:40,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:40,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {307#true} is VALID [2022-04-15 06:12:40,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-15 06:12:40,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-15 06:12:40,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-15 06:12:40,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {312#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:40,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:40,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:40,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {314#(and (= (+ (- 1) main_~j~0) 0) (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:40,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(and (= (+ (- 1) main_~j~0) 0) (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:40,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:40,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:40,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:40,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {315#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {316#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:40,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {316#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {317#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:40,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {317#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {308#false} is VALID [2022-04-15 06:12:40,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-15 06:12:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:12:40,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:40,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142497767] [2022-04-15 06:12:40,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142497767] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:12:40,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816832344] [2022-04-15 06:12:40,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:12:40,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:40,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:40,748 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-15 06:12:40,749 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-15 06:12:40,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:12:40,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:12:40,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 06:12:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:40,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:12:41,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-15 06:12:41,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {307#true} is VALID [2022-04-15 06:12:41,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-15 06:12:41,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-15 06:12:41,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-15 06:12:41,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {312#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:41,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:41,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:41,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-15 06:12:41,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-15 06:12:41,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-15 06:12:41,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume !(0 != #t~nondet2);havoc #t~nondet2; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-15 06:12:41,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} assume 0 != ~flag~0; {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-15 06:12:41,045 INFO L272 TraceCheckUtils]: 13: Hoare triple {346#(and (= main_~a~0 1) (= (+ (- 1) main_~b~0) 0))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:12:41,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:12:41,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-15 06:12:41,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-15 06:12:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:12:41,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:12:41,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-15 06:12:41,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-15 06:12:41,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:12:41,193 INFO L272 TraceCheckUtils]: 13: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:12:41,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:41,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:41,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:41,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:41,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {398#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {382#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:41,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {398#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {398#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:41,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {398#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:41,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {405#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0) 4294967296))} is VALID [2022-04-15 06:12:41,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-15 06:12:41,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-15 06:12:41,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-15 06:12:41,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {307#true} is VALID [2022-04-15 06:12:41,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-15 06:12:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:12:41,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816832344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:12:41,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:12:41,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-15 06:12:41,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:41,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1009752573] [2022-04-15 06:12:41,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1009752573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:41,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:41,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:12:41,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562667847] [2022-04-15 06:12:41,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:12:41,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:41,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-15 06:12:41,215 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-15 06:12:41,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:12:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:12:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:12:41,216 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-15 06:12:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:41,444 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 06:12:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:12:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:12:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-15 06:12:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-15 06:12:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-15 06:12:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-15 06:12:41,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-15 06:12:41,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:41,477 INFO L225 Difference]: With dead ends: 29 [2022-04-15 06:12:41,477 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:12:41,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:12:41,478 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:41,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 36 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:12:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:12:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-15 06:12:41,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:41,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,488 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,488 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:41,489 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 06:12:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:12:41,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:41,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:41,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:12:41,490 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:12:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:41,491 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 06:12:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:12:41,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:41,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:41,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:41,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-15 06:12:41,492 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-04-15 06:12:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:41,493 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-15 06:12:41,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 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-15 06:12:41,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-15 06:12:41,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 06:12:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:12:41,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:41,517 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:41,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 06:12:41,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:41,736 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 1 times [2022-04-15 06:12:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:41,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853573233] [2022-04-15 06:12:41,737 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 2 times [2022-04-15 06:12:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951099498] [2022-04-15 06:12:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:41,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:41,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {584#true} is VALID [2022-04-15 06:12:41,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-15 06:12:41,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #68#return; {584#true} is VALID [2022-04-15 06:12:41,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {584#true} call ULTIMATE.init(); {590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:41,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {584#true} is VALID [2022-04-15 06:12:41,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-15 06:12:41,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {584#true} {584#true} #68#return; {584#true} is VALID [2022-04-15 06:12:41,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {584#true} call #t~ret5 := main(); {584#true} is VALID [2022-04-15 06:12:41,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {584#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {584#true} is VALID [2022-04-15 06:12:41,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} assume !(0 != ~flag~0);~i~0 := 1; {589#(= main_~flag~0 0)} is VALID [2022-04-15 06:12:41,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#(= main_~flag~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {589#(= main_~flag~0 0)} is VALID [2022-04-15 06:12:41,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#(= main_~flag~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {589#(= main_~flag~0 0)} is VALID [2022-04-15 06:12:41,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#(= main_~flag~0 0)} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {589#(= main_~flag~0 0)} is VALID [2022-04-15 06:12:41,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {589#(= main_~flag~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {589#(= main_~flag~0 0)} is VALID [2022-04-15 06:12:41,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {589#(= main_~flag~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {589#(= main_~flag~0 0)} is VALID [2022-04-15 06:12:41,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {589#(= main_~flag~0 0)} assume 0 != ~flag~0; {585#false} is VALID [2022-04-15 06:12:41,831 INFO L272 TraceCheckUtils]: 13: Hoare triple {585#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {585#false} is VALID [2022-04-15 06:12:41,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {585#false} ~cond := #in~cond; {585#false} is VALID [2022-04-15 06:12:41,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#false} assume 0 == ~cond; {585#false} is VALID [2022-04-15 06:12:41,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-04-15 06:12:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:12:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:41,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951099498] [2022-04-15 06:12:41,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951099498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:41,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:41,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:12:41,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853573233] [2022-04-15 06:12:41,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853573233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:41,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:41,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:12:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441809871] [2022-04-15 06:12:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:41,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:12:41,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:41,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,846 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-15 06:12:41,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:12:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:12:41,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:12:41,848 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:41,910 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 06:12:41,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:12:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:12:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 06:12:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 06:12:41,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 06:12:41,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:41,939 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:12:41,939 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:12:41,939 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:12:41,941 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:41,942 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:12:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 06:12:41,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:41,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,955 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,955 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:41,958 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:12:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:12:41,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:41,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:41,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:12:41,960 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:12:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:41,961 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:12:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:12:41,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:41,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:41,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:41,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 06:12:41,970 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-15 06:12:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:41,970 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 06:12:41,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:41,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 06:12:41,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:12:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:12:41,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:41,995 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:41,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:12:41,995 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 3 times [2022-04-15 06:12:41,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:41,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [982678525] [2022-04-15 06:12:41,997 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 4 times [2022-04-15 06:12:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:41,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518457602] [2022-04-15 06:12:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:42,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:42,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {743#true} is VALID [2022-04-15 06:12:42,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-15 06:12:42,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-15 06:12:42,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:42,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {743#true} is VALID [2022-04-15 06:12:42,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-15 06:12:42,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-15 06:12:42,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-15 06:12:42,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {748#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:42,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {748#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:42,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:42,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {750#(and (<= (+ main_~b~0 3) (+ main_~i~0 main_~a~0 main_~j~0)) (<= (+ main_~i~0 main_~a~0 main_~j~0) (+ main_~b~0 3)) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-15 06:12:42,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {750#(and (<= (+ main_~b~0 3) (+ main_~i~0 main_~a~0 main_~j~0)) (<= (+ main_~i~0 main_~a~0 main_~j~0) (+ main_~b~0 3)) (= (+ (- 1) main_~j~0) 0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {751#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-15 06:12:42,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {751#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {751#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-15 06:12:42,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {751#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:42,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:42,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:42,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:42,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:42,284 INFO L272 TraceCheckUtils]: 16: Hoare triple {752#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:42,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {754#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:42,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {744#false} is VALID [2022-04-15 06:12:42,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-15 06:12:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:12:42,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:42,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518457602] [2022-04-15 06:12:42,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518457602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:12:42,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337184480] [2022-04-15 06:12:42,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:12:42,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:42,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:42,287 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-15 06:12:42,302 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-15 06:12:42,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:12:42,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:12:42,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 06:12:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:42,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:12:42,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-15 06:12:42,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {743#true} is VALID [2022-04-15 06:12:42,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-15 06:12:42,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-15 06:12:42,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-15 06:12:42,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {748#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:42,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {748#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:42,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:42,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {749#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {783#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} is VALID [2022-04-15 06:12:42,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {787#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-15 06:12:42,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {787#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {787#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-15 06:12:42,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {787#(and (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2) (= (+ main_~b~0 2) main_~j~0) (= (+ (- 1) main_~b~0) 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-15 06:12:42,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-15 06:12:42,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-15 06:12:42,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume !(0 != #t~nondet2);havoc #t~nondet2; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-15 06:12:42,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} assume 0 != ~flag~0; {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} is VALID [2022-04-15 06:12:42,528 INFO L272 TraceCheckUtils]: 16: Hoare triple {794#(and (= (+ (* (- 1) main_~b~0) 4) 2) (= main_~a~0 2))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:12:42,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:12:42,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-15 06:12:42,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-15 06:12:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:12:42,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:12:42,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-15 06:12:42,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-15 06:12:42,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:12:42,740 INFO L272 TraceCheckUtils]: 16: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:12:42,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:42,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:42,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:42,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:42,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {846#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {830#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:42,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {846#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:42,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {846#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:42,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {857#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {853#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:42,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {857#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-15 06:12:42,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {864#(= (mod (+ (* main_~j~0 2) main_~b~0) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {857#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-15 06:12:42,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {864#(= (mod (+ (* main_~j~0 2) main_~b~0) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-15 06:12:42,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-15 06:12:42,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-15 06:12:42,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-15 06:12:42,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {743#true} is VALID [2022-04-15 06:12:42,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-15 06:12:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:12:42,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337184480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:12:42,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:12:42,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-15 06:12:42,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:42,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [982678525] [2022-04-15 06:12:42,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [982678525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:42,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:42,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:12:42,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735556625] [2022-04-15 06:12:42,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:42,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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 20 [2022-04-15 06:12:42,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:42,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-15 06:12:42,767 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-15 06:12:42,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:12:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:42,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:12:42,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:12:42,769 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-15 06:12:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:43,124 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-15 06:12:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:12:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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 20 [2022-04-15 06:12:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-15 06:12:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-15 06:12:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-15 06:12:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-15 06:12:43,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-15 06:12:43,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:43,161 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:12:43,161 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 06:12:43,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:12:43,162 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:43,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 51 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:12:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 06:12:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 06:12:43,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:43,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:43,176 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:43,177 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:43,177 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 06:12:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:12:43,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:43,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:43,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 06:12:43,178 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 06:12:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:43,179 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 06:12:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:12:43,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:43,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:43,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:43,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 06:12:43,180 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-04-15 06:12:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:43,180 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 06:12:43,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 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-15 06:12:43,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 06:12:43,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:12:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:12:43,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:43,202 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:43,249 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-15 06:12:43,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:43,402 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash -831901207, now seen corresponding path program 5 times [2022-04-15 06:12:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:43,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525388156] [2022-04-15 06:12:43,403 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash -831901207, now seen corresponding path program 6 times [2022-04-15 06:12:43,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:43,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951353119] [2022-04-15 06:12:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:43,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {1087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1073#true} is VALID [2022-04-15 06:12:43,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-15 06:12:43,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-15 06:12:43,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:43,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {1087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1073#true} is VALID [2022-04-15 06:12:43,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-15 06:12:43,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-15 06:12:43,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-15 06:12:43,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {1073#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1078#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:43,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {1078#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:43,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:43,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1080#(and (<= (+ 5 main_~b~0) (+ main_~a~0 main_~j~0 (* main_~i~0 2))) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~a~0 main_~j~0 (* main_~i~0 2)) (+ 5 main_~b~0)))} is VALID [2022-04-15 06:12:43,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {1080#(and (<= (+ 5 main_~b~0) (+ main_~a~0 main_~j~0 (* main_~i~0 2))) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~a~0 main_~j~0 (* main_~i~0 2)) (+ 5 main_~b~0)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1081#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} is VALID [2022-04-15 06:12:43,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {1081#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1081#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} is VALID [2022-04-15 06:12:43,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1081#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1082#(and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~b~0 main_~j~0 1)))} is VALID [2022-04-15 06:12:43,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {1082#(and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~b~0 main_~j~0 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1083#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-15 06:12:43,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {1083#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1083#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-15 06:12:43,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {1083#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:43,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:43,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:43,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:43,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:43,617 INFO L272 TraceCheckUtils]: 19: Hoare triple {1084#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1085#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:43,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {1085#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1086#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:43,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {1086#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1074#false} is VALID [2022-04-15 06:12:43,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-15 06:12:43,618 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-15 06:12:43,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:43,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951353119] [2022-04-15 06:12:43,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951353119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:12:43,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308139084] [2022-04-15 06:12:43,619 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:12:43,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:43,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:43,620 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-15 06:12:43,621 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-15 06:12:43,666 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 06:12:43,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:12:43,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 06:12:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:43,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:12:43,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2022-04-15 06:12:43,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1073#true} is VALID [2022-04-15 06:12:43,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-15 06:12:43,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-15 06:12:43,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-15 06:12:43,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {1073#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1078#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:43,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {1078#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:43,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:43,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1115#(and (= (+ (- 2) main_~i~0) 0) (= main_~b~0 (+ (* (- 1) main_~i~0) main_~j~0 2)) (= (+ (- 1) main_~j~0) 0) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-15 06:12:43,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(and (= (+ (- 2) main_~i~0) 0) (= main_~b~0 (+ (* (- 1) main_~i~0) main_~j~0 2)) (= (+ (- 1) main_~j~0) 0) (= (+ (- 1) main_~a~0) 0))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1119#(and (= (+ (- 2) main_~i~0) 0) (= (+ main_~j~0 (- 3)) 0) (= (+ (- 1) main_~a~0) 0) (= (+ (* (- 1) main_~i~0) main_~j~0) main_~b~0))} is VALID [2022-04-15 06:12:43,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {1119#(and (= (+ (- 2) main_~i~0) 0) (= (+ main_~j~0 (- 3)) 0) (= (+ (- 1) main_~a~0) 0) (= (+ (* (- 1) main_~i~0) main_~j~0) main_~b~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1119#(and (= (+ (- 2) main_~i~0) 0) (= (+ main_~j~0 (- 3)) 0) (= (+ (- 1) main_~a~0) 0) (= (+ (* (- 1) main_~i~0) main_~j~0) main_~b~0))} is VALID [2022-04-15 06:12:43,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#(and (= (+ (- 2) main_~i~0) 0) (= (+ main_~j~0 (- 3)) 0) (= (+ (- 1) main_~a~0) 0) (= (+ (* (- 1) main_~i~0) main_~j~0) main_~b~0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1126#(and (= (+ main_~j~0 (- 3)) 0) (= (+ (- 2) main_~a~0) 0) (= main_~b~0 (+ (* main_~j~0 2) (- 4))) (= main_~i~0 4))} is VALID [2022-04-15 06:12:43,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {1126#(and (= (+ main_~j~0 (- 3)) 0) (= (+ (- 2) main_~a~0) 0) (= main_~b~0 (+ (* main_~j~0 2) (- 4))) (= main_~i~0 4))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1130#(and (= 5 main_~j~0) (= main_~b~0 2) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 4))} is VALID [2022-04-15 06:12:43,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1130#(and (= 5 main_~j~0) (= main_~b~0 2) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 4))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1130#(and (= 5 main_~j~0) (= main_~b~0 2) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 4))} is VALID [2022-04-15 06:12:43,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1130#(and (= 5 main_~j~0) (= main_~b~0 2) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 4))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-15 06:12:43,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-15 06:12:43,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-15 06:12:43,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-15 06:12:43,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} assume 0 != ~flag~0; {1137#(and (= main_~b~0 3) (= main_~a~0 3))} is VALID [2022-04-15 06:12:43,954 INFO L272 TraceCheckUtils]: 19: Hoare triple {1137#(and (= main_~b~0 3) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:12:43,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:12:43,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1074#false} is VALID [2022-04-15 06:12:43,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-15 06:12:43,955 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-15 06:12:43,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:12:44,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-15 06:12:44,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1074#false} is VALID [2022-04-15 06:12:44,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:12:44,234 INFO L272 TraceCheckUtils]: 19: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:12:44,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:44,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:44,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:44,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:44,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {1189#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1173#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:44,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {1189#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1189#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:44,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {1196#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1189#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:44,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {1200#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1196#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:44,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {1200#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1200#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-15 06:12:44,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294) 4) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1200#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-15 06:12:44,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {1211#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1207#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294) 4) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-15 06:12:44,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1211#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-15 06:12:44,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {1218#(= (mod (+ main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {1211#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-15 06:12:44,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {1073#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1218#(= (mod (+ main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-15 06:12:44,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-15 06:12:44,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-15 06:12:44,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-15 06:12:44,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1073#true} is VALID [2022-04-15 06:12:44,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2022-04-15 06:12:44,246 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-15 06:12:44,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308139084] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:12:44,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:12:44,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-04-15 06:12:44,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:44,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1525388156] [2022-04-15 06:12:44,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1525388156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:44,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:44,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:12:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698690873] [2022-04-15 06:12:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:44,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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 23 [2022-04-15 06:12:44,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:44,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-15 06:12:44,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:44,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:12:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:44,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:12:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:12:44,267 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-15 06:12:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:44,743 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-15 06:12:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:12:44,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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 23 [2022-04-15 06:12:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-15 06:12:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-15 06:12:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-15 06:12:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-15 06:12:44,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 36 transitions. [2022-04-15 06:12:44,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:44,788 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:12:44,788 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:12:44,789 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:12:44,790 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:44,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 50 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:12:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:12:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-15 06:12:44,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:44,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-15 06:12:44,839 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-15 06:12:44,840 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-15 06:12:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:44,840 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 06:12:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:12:44,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:44,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:44,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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 29 states. [2022-04-15 06:12:44,841 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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 29 states. [2022-04-15 06:12:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:44,842 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 06:12:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:12:44,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:44,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:44,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:44,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-15 06:12:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 06:12:44,843 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-15 06:12:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:44,843 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 06:12:44,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 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-15 06:12:44,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 06:12:44,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 06:12:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:12:44,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:44,873 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:44,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 06:12:45,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:45,074 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:45,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:45,074 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 1 times [2022-04-15 06:12:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:45,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523905109] [2022-04-15 06:12:45,074 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 2 times [2022-04-15 06:12:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:45,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145895056] [2022-04-15 06:12:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:45,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:45,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {1447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1439#true} is VALID [2022-04-15 06:12:45,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-15 06:12:45,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-15 06:12:45,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:45,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1439#true} is VALID [2022-04-15 06:12:45,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-15 06:12:45,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-15 06:12:45,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-15 06:12:45,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {1439#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1439#true} is VALID [2022-04-15 06:12:45,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1444#(= main_~i~0 0)} is VALID [2022-04-15 06:12:45,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {1444#(= main_~i~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1444#(= main_~i~0 0)} is VALID [2022-04-15 06:12:45,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {1444#(= main_~i~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:12:45,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:12:45,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:12:45,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1446#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 4 main_~i~0))} is VALID [2022-04-15 06:12:45,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {1446#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 4 main_~i~0))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1440#false} is VALID [2022-04-15 06:12:45,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-15 06:12:45,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {1440#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1440#false} is VALID [2022-04-15 06:12:45,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {1440#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1440#false} is VALID [2022-04-15 06:12:45,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-15 06:12:45,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-15 06:12:45,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-15 06:12:45,156 INFO L272 TraceCheckUtils]: 19: Hoare triple {1440#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1440#false} is VALID [2022-04-15 06:12:45,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-15 06:12:45,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-15 06:12:45,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-15 06:12:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:12:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:45,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145895056] [2022-04-15 06:12:45,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145895056] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:12:45,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595212558] [2022-04-15 06:12:45,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:12:45,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:45,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:45,161 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-15 06:12:45,184 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-15 06:12:45,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:12:45,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:12:45,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:12:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:45,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:12:45,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2022-04-15 06:12:45,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1439#true} is VALID [2022-04-15 06:12:45,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-15 06:12:45,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-15 06:12:45,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-15 06:12:45,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {1439#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1439#true} is VALID [2022-04-15 06:12:45,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1444#(= main_~i~0 0)} is VALID [2022-04-15 06:12:45,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {1444#(= main_~i~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1444#(= main_~i~0 0)} is VALID [2022-04-15 06:12:45,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {1444#(= main_~i~0 0)} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:12:45,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:12:45,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 06:12:45,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {1445#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1484#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 06:12:45,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {1484#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1440#false} is VALID [2022-04-15 06:12:45,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-15 06:12:45,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {1440#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1440#false} is VALID [2022-04-15 06:12:45,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {1440#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1440#false} is VALID [2022-04-15 06:12:45,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-15 06:12:45,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-15 06:12:45,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-15 06:12:45,498 INFO L272 TraceCheckUtils]: 19: Hoare triple {1440#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1440#false} is VALID [2022-04-15 06:12:45,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-15 06:12:45,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-15 06:12:45,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-15 06:12:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:12:45,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:12:45,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-15 06:12:45,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-15 06:12:45,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-15 06:12:45,568 INFO L272 TraceCheckUtils]: 19: Hoare triple {1440#false} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1440#false} is VALID [2022-04-15 06:12:45,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-15 06:12:45,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-15 06:12:45,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-15 06:12:45,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {1440#false} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1440#false} is VALID [2022-04-15 06:12:45,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {1440#false} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1440#false} is VALID [2022-04-15 06:12:45,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-15 06:12:45,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume !(0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296);#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1440#false} is VALID [2022-04-15 06:12:45,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 06:12:45,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 06:12:45,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 06:12:45,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 06:12:45,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {1548#(= 0 (mod main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 06:12:45,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1548#(= 0 (mod main_~i~0 2))} is VALID [2022-04-15 06:12:45,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {1439#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1439#true} is VALID [2022-04-15 06:12:45,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-15 06:12:45,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-15 06:12:45,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-15 06:12:45,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1439#true} is VALID [2022-04-15 06:12:45,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2022-04-15 06:12:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 06:12:45,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595212558] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 06:12:45,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:12:45,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 5] total 8 [2022-04-15 06:12:45,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:45,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [523905109] [2022-04-15 06:12:45,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [523905109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:45,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:45,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:12:45,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853901805] [2022-04-15 06:12:45,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:12:45,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:45,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:45,588 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-15 06:12:45,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:12:45,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:45,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:12:45,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:45,589 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:45,644 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 06:12:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:12:45,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:12:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-15 06:12:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-15 06:12:45,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-04-15 06:12:45,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:45,680 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:12:45,680 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:12:45,680 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:45,681 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:45,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:12:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:12:45,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:45,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-15 06:12:45,706 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-15 06:12:45,706 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-15 06:12:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:45,707 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 06:12:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 06:12:45,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:45,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:45,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 27 states. [2022-04-15 06:12:45,708 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 27 states. [2022-04-15 06:12:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:45,708 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 06:12:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 06:12:45,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:45,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:45,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:45,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-15 06:12:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 06:12:45,710 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2022-04-15 06:12:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:45,710 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 06:12:45,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:45,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 06:12:45,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 06:12:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:12:45,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:45,736 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:45,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 06:12:45,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:45,952 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:45,952 INFO L85 PathProgramCache]: Analyzing trace with hash -931312425, now seen corresponding path program 7 times [2022-04-15 06:12:45,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:45,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367514576] [2022-04-15 06:12:45,953 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash -931312425, now seen corresponding path program 8 times [2022-04-15 06:12:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:45,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637694163] [2022-04-15 06:12:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:45,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:46,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:46,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {1787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1771#true} is VALID [2022-04-15 06:12:46,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 06:12:46,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-15 06:12:46,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:46,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1771#true} is VALID [2022-04-15 06:12:46,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 06:12:46,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-15 06:12:46,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-15 06:12:46,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {1771#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1776#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:46,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {1776#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:46,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:46,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1778#(and (<= (+ main_~a~0 main_~j~0 (* main_~i~0 3)) (+ 7 main_~b~0)) (= (+ (- 1) main_~j~0) 0) (<= (+ 7 main_~b~0) (+ main_~a~0 main_~j~0 (* main_~i~0 3))))} is VALID [2022-04-15 06:12:46,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {1778#(and (<= (+ main_~a~0 main_~j~0 (* main_~i~0 3)) (+ 7 main_~b~0)) (= (+ (- 1) main_~j~0) 0) (<= (+ 7 main_~b~0) (+ main_~a~0 main_~j~0 (* main_~i~0 3))))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1779#(and (<= (+ main_~a~0 3 (* main_~i~0 3)) (+ main_~b~0 (* main_~j~0 3))) (<= (+ main_~b~0 (* main_~j~0 3)) (+ main_~a~0 3 (* main_~i~0 3))))} is VALID [2022-04-15 06:12:46,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {1779#(and (<= (+ main_~a~0 3 (* main_~i~0 3)) (+ main_~b~0 (* main_~j~0 3))) (<= (+ main_~b~0 (* main_~j~0 3)) (+ main_~a~0 3 (* main_~i~0 3))))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1779#(and (<= (+ main_~a~0 3 (* main_~i~0 3)) (+ main_~b~0 (* main_~j~0 3))) (<= (+ main_~b~0 (* main_~j~0 3)) (+ main_~a~0 3 (* main_~i~0 3))))} is VALID [2022-04-15 06:12:46,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {1779#(and (<= (+ main_~a~0 3 (* main_~i~0 3)) (+ main_~b~0 (* main_~j~0 3))) (<= (+ main_~b~0 (* main_~j~0 3)) (+ main_~a~0 3 (* main_~i~0 3))))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1780#(and (<= (+ main_~a~0 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0 2)) (<= (+ (* main_~j~0 2) main_~b~0 2) (+ main_~a~0 (* main_~i~0 2))))} is VALID [2022-04-15 06:12:46,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {1780#(and (<= (+ main_~a~0 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0 2)) (<= (+ (* main_~j~0 2) main_~b~0 2) (+ main_~a~0 (* main_~i~0 2))))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1781#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} is VALID [2022-04-15 06:12:46,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {1781#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1781#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} is VALID [2022-04-15 06:12:46,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {1781#(and (<= (+ (* main_~j~0 2) main_~b~0) (+ main_~a~0 2 (* main_~i~0 2))) (<= (+ main_~a~0 2 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1782#(and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~b~0 main_~j~0 1)))} is VALID [2022-04-15 06:12:46,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {1782#(and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~i~0 main_~a~0) (+ main_~b~0 main_~j~0 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1783#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-15 06:12:46,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {1783#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1783#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} is VALID [2022-04-15 06:12:46,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {1783#(and (<= (+ main_~i~0 main_~a~0 1) (+ main_~b~0 main_~j~0)) (<= (+ main_~b~0 main_~j~0) (+ main_~i~0 main_~a~0 1)))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:46,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:46,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:46,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:46,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} assume 0 != ~flag~0; {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:12:46,260 INFO L272 TraceCheckUtils]: 22: Hoare triple {1784#(and (<= (div main_~a~0 4294967296) (div main_~b~0 4294967296)) (<= (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296)) (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296))) (< (+ main_~b~0 (* (div main_~a~0 4294967296) 4294967296)) (+ main_~a~0 (* (div main_~b~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1785#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:46,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {1785#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1786#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:46,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {1786#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1772#false} is VALID [2022-04-15 06:12:46,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-15 06:12:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:12:46,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:46,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637694163] [2022-04-15 06:12:46,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637694163] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:12:46,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651542199] [2022-04-15 06:12:46,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:12:46,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:46,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:46,276 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-15 06:12:46,277 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-15 06:12:46,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:12:46,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:12:46,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 06:12:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:46,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:12:46,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-15 06:12:46,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1771#true} is VALID [2022-04-15 06:12:46,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 06:12:46,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-15 06:12:46,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-15 06:12:46,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {1771#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1776#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} is VALID [2022-04-15 06:12:46,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {1776#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0))} assume 0 != ~flag~0;~i~0 := 0; {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:46,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:46,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {1777#(and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1815#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} is VALID [2022-04-15 06:12:46,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {1815#(and (= (+ (- 1) main_~j~0) 0) (= main_~b~0 main_~j~0) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1819#(and (= main_~b~0 1) (= main_~j~0 3) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} is VALID [2022-04-15 06:12:46,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {1819#(and (= main_~b~0 1) (= main_~j~0 3) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1819#(and (= main_~b~0 1) (= main_~j~0 3) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} is VALID [2022-04-15 06:12:46,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {1819#(and (= main_~b~0 1) (= main_~j~0 3) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 2))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1826#(and (= (+ main_~b~0 2 (* (- 1) main_~j~0)) 1) (= main_~j~0 3) (= main_~a~0 2) (= main_~i~0 4))} is VALID [2022-04-15 06:12:46,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {1826#(and (= (+ main_~b~0 2 (* (- 1) main_~j~0)) 1) (= main_~j~0 3) (= main_~a~0 2) (= main_~i~0 4))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1830#(and (= main_~j~0 (+ main_~b~0 3)) (= main_~a~0 2) (= main_~i~0 4) (= (+ main_~b~0 1) 3))} is VALID [2022-04-15 06:12:46,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(and (= main_~j~0 (+ main_~b~0 3)) (= main_~a~0 2) (= main_~i~0 4) (= (+ main_~b~0 1) 3))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1830#(and (= main_~j~0 (+ main_~b~0 3)) (= main_~a~0 2) (= main_~i~0 4) (= (+ main_~b~0 1) 3))} is VALID [2022-04-15 06:12:46,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {1830#(and (= main_~j~0 (+ main_~b~0 3)) (= main_~a~0 2) (= main_~i~0 4) (= (+ main_~b~0 1) 3))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1837#(and (= (+ (* main_~j~0 2) (* (- 1) main_~b~0) (- 3)) 4) (= (+ (- 2) main_~j~0) 3) (= main_~i~0 (+ (- 1) (* main_~j~0 2) (* (- 1) main_~b~0))) (= main_~a~0 3))} is VALID [2022-04-15 06:12:46,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1837#(and (= (+ (* main_~j~0 2) (* (- 1) main_~b~0) (- 3)) 4) (= (+ (- 2) main_~j~0) 3) (= main_~i~0 (+ (- 1) (* main_~j~0 2) (* (- 1) main_~b~0))) (= main_~a~0 3))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1841#(and (= 4 (+ 7 (* (- 1) main_~b~0))) (= main_~i~0 (+ 9 (* (- 1) main_~b~0))) (= 7 main_~j~0) (= main_~a~0 3))} is VALID [2022-04-15 06:12:46,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {1841#(and (= 4 (+ 7 (* (- 1) main_~b~0))) (= main_~i~0 (+ 9 (* (- 1) main_~b~0))) (= 7 main_~j~0) (= main_~a~0 3))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1841#(and (= 4 (+ 7 (* (- 1) main_~b~0))) (= main_~i~0 (+ 9 (* (- 1) main_~b~0))) (= 7 main_~j~0) (= main_~a~0 3))} is VALID [2022-04-15 06:12:46,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {1841#(and (= 4 (+ 7 (* (- 1) main_~b~0))) (= main_~i~0 (+ 9 (* (- 1) main_~b~0))) (= 7 main_~j~0) (= main_~a~0 3))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-15 06:12:46,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-15 06:12:46,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-15 06:12:46,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-15 06:12:46,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} assume 0 != ~flag~0; {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} is VALID [2022-04-15 06:12:46,769 INFO L272 TraceCheckUtils]: 22: Hoare triple {1848#(and (= (+ (- 1) main_~a~0) 3) (= 7 (+ main_~b~0 3)))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:12:46,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1868#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:12:46,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {1868#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-15 06:12:46,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-15 06:12:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:12:46,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:12:47,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-15 06:12:47,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {1868#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-15 06:12:47,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1868#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:12:47,147 INFO L272 TraceCheckUtils]: 22: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} call __VERIFIER_assert((if ~a~0 % 4294967296 == ~b~0 % 4294967296 then 1 else 0)); {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:12:47,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 != ~flag~0; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:47,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:47,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:47,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:47,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1884#(= (mod main_~a~0 4294967296) (mod main_~b~0 4294967296))} is VALID [2022-04-15 06:12:47,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1900#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:47,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {1907#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1900#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:47,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {1911#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1907#(= (mod (+ main_~a~0 1) 4294967296) (mod (+ main_~b~0 main_~j~0 2 (* main_~i~0 4294967295)) 4294967296))} is VALID [2022-04-15 06:12:47,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1911#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-15 06:12:47,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {1918#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294) 4) 4294967296) (mod (+ main_~a~0 2) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1911#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294)) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-15 06:12:47,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {1922#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1918#(= (mod (+ (* main_~j~0 2) main_~b~0 (* main_~i~0 4294967294) 4) 4294967296) (mod (+ main_~a~0 2) 4294967296))} is VALID [2022-04-15 06:12:47,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {1922#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1922#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-15 06:12:47,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {1929#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 6 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} assume 0 == (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 2 + ~j~0; {1922#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-15 06:12:47,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(= (mod (+ (* 4294967292 main_~i~0) main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} assume !!(0 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := 1 + #t~post3;havoc #t~post3;~b~0 := ~b~0 + (~j~0 - ~i~0);~i~0 := 2 + ~i~0; {1929#(= (mod (+ (* main_~i~0 4294967293) main_~b~0 6 (* main_~j~0 3)) 4294967296) (mod (+ main_~a~0 3) 4294967296))} is VALID [2022-04-15 06:12:47,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(= (mod (+ (* 4294967292 main_~i~0) main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1933#(= (mod (+ (* 4294967292 main_~i~0) main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} is VALID [2022-04-15 06:12:47,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {1940#(= (mod (+ main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} assume 0 != ~flag~0;~i~0 := 0; {1933#(= (mod (+ (* 4294967292 main_~i~0) main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} is VALID [2022-04-15 06:12:47,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1771#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0;~b~0 := 0;~j~0 := 1; {1940#(= (mod (+ main_~b~0 (* main_~j~0 4)) 4294967296) (mod (+ main_~a~0 4) 4294967296))} is VALID [2022-04-15 06:12:47,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-15 06:12:47,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-15 06:12:47,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-15 06:12:47,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1771#true} is VALID [2022-04-15 06:12:47,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-15 06:12:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:12:47,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651542199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:12:47,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:12:47,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2022-04-15 06:12:47,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:47,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367514576] [2022-04-15 06:12:47,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367514576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:47,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:47,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:12:47,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006141998] [2022-04-15 06:12:47,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:47,194 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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 26 [2022-04-15 06:12:47,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:47,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-15 06:12:47,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:47,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:12:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:12:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:12:47,215 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-15 06:12:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:47,666 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 06:12:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:12:47,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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 26 [2022-04-15 06:12:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-15 06:12:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2022-04-15 06:12:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-15 06:12:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2022-04-15 06:12:47,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 19 transitions. [2022-04-15 06:12:47,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-15 06:12:47,687 INFO L225 Difference]: With dead ends: 27 [2022-04-15 06:12:47,687 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:12:47,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:12:47,688 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:47,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:12:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:12:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:12:47,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:47,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:12:47,689 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:12:47,689 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:12:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:47,689 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:12:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:12:47,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:47,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:47,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:12:47,690 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:12:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:47,690 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:12:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:12:47,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:47,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:47,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:47,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:12:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:12:47,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-15 06:12:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:47,691 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:12:47,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 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-15 06:12:47,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:12:47,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:12:47,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:47,693 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:12:47,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 06:12:47,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:12:47,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:12:48,169 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 06:12:48,170 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 06:12:48,170 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 06:12:48,170 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-15 06:12:48,170 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:12:48,170 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:12:48,170 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:12:48,170 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 24 49) the Hoare annotation is: (or (= main_~flag~0 0) (let ((.cse1 (div main_~b~0 4294967296)) (.cse0 (div main_~a~0 4294967296))) (let ((.cse3 (+ main_~b~0 (* .cse0 4294967296))) (.cse2 (* .cse1 4294967296))) (and (<= .cse0 .cse1) (<= (+ main_~a~0 .cse2) .cse3) (< .cse3 (+ main_~a~0 .cse2 1)))))) [2022-04-15 06:12:48,170 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 49) the Hoare annotation is: true [2022-04-15 06:12:48,170 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse1 (div main_~b~0 4294967296)) (.cse0 (div main_~a~0 4294967296))) (let ((.cse3 (+ main_~b~0 (* .cse0 4294967296))) (.cse2 (* .cse1 4294967296))) (and (<= .cse0 .cse1) (<= (+ main_~a~0 .cse2) .cse3) (< .cse3 (+ main_~a~0 .cse2 1))))) [2022-04-15 06:12:48,170 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 49) the Hoare annotation is: true [2022-04-15 06:12:48,170 INFO L878 garLoopResultBuilder]: At program point L30(lines 30 34) the Hoare annotation is: (and (= main_~a~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~b~0 0)) [2022-04-15 06:12:48,170 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 49) the Hoare annotation is: true [2022-04-15 06:12:48,170 INFO L885 garLoopResultBuilder]: At program point L45(lines 45 47) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 43) the Hoare annotation is: (or (= main_~flag~0 0) (let ((.cse1 (div main_~b~0 4294967296)) (.cse0 (div main_~a~0 4294967296))) (and (<= (+ main_~b~0 main_~j~0 1) (+ main_~i~0 main_~a~0)) (<= (+ main_~a~0 (* main_~i~0 2)) (+ (* main_~j~0 2) main_~b~0 2)) (= 0 (mod main_~i~0 2)) (<= .cse0 .cse1) (<= (+ main_~a~0 (* .cse1 4294967296)) (+ main_~b~0 (* .cse0 4294967296)))))) [2022-04-15 06:12:48,171 INFO L878 garLoopResultBuilder]: At program point L39-2(lines 24 49) the Hoare annotation is: (or (let ((.cse1 (+ main_~b~0 (* main_~j~0 3))) (.cse0 (+ main_~a~0 3 (* main_~i~0 3))) (.cse3 (+ main_~a~0 2 (* main_~i~0 2))) (.cse2 (+ (* main_~j~0 2) main_~b~0))) (and (= 0 (mod main_~i~0 2)) (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse1 .cse0) (<= .cse3 .cse2))) (= main_~flag~0 0)) [2022-04-15 06:12:48,171 INFO L878 garLoopResultBuilder]: At program point L35(lines 35 44) the Hoare annotation is: (or (let ((.cse1 (+ main_~b~0 (* main_~j~0 3))) (.cse0 (+ main_~a~0 3 (* main_~i~0 3))) (.cse3 (+ main_~a~0 2 (* main_~i~0 2))) (.cse2 (+ (* main_~j~0 2) main_~b~0))) (and (= 0 (mod main_~i~0 2)) (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse1 .cse0) (<= .cse3 .cse2))) (= main_~flag~0 0)) [2022-04-15 06:12:48,171 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 06:12:48,171 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-15 06:12:48,171 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 06:12:48,171 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 06:12:48,172 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 06:12:48,173 INFO L719 BasicCegarLoop]: Path program histogram: [8, 2, 2, 2, 2] [2022-04-15 06:12:48,174 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:12:48,176 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:12:48,176 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:12:48,177 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 06:12:48,178 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 06:12:48,178 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:12:48,178 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:12:48,179 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 06:12:48,190 INFO L163 areAnnotationChecker]: CFG has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 06:12:48,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:12:48 BoogieIcfgContainer [2022-04-15 06:12:48,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:12:48,196 INFO L158 Benchmark]: Toolchain (without parser) took 9290.05ms. Allocated memory was 210.8MB in the beginning and 317.7MB in the end (delta: 107.0MB). Free memory was 160.8MB in the beginning and 230.5MB in the end (delta: -69.7MB). Peak memory consumption was 38.2MB. Max. memory is 8.0GB. [2022-04-15 06:12:48,196 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory was 177.1MB in the beginning and 176.9MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:12:48,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.91ms. Allocated memory is still 210.8MB. Free memory was 160.7MB in the beginning and 186.5MB in the end (delta: -25.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 06:12:48,196 INFO L158 Benchmark]: Boogie Preprocessor took 30.43ms. Allocated memory is still 210.8MB. Free memory was 186.5MB in the beginning and 185.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 06:12:48,197 INFO L158 Benchmark]: RCFGBuilder took 281.69ms. Allocated memory is still 210.8MB. Free memory was 185.2MB in the beginning and 173.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 06:12:48,197 INFO L158 Benchmark]: TraceAbstraction took 8743.24ms. Allocated memory was 210.8MB in the beginning and 317.7MB in the end (delta: 107.0MB). Free memory was 173.4MB in the beginning and 230.5MB in the end (delta: -57.1MB). Peak memory consumption was 50.9MB. Max. memory is 8.0GB. [2022-04-15 06:12:48,198 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory was 177.1MB in the beginning and 176.9MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.91ms. Allocated memory is still 210.8MB. Free memory was 160.7MB in the beginning and 186.5MB in the end (delta: -25.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.43ms. Allocated memory is still 210.8MB. Free memory was 186.5MB in the beginning and 185.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 281.69ms. Allocated memory is still 210.8MB. Free memory was 185.2MB in the beginning and 173.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8743.24ms. Allocated memory was 210.8MB in the beginning and 317.7MB in the end (delta: 107.0MB). Free memory was 173.4MB in the beginning and 230.5MB in the end (delta: -57.1MB). Peak memory consumption was 50.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 179 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 129 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 179 SyntacticMatches, 9 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=6, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 71 PreInvPairs, 118 NumberOfFragments, 296 HoareAnnotationTreeSize, 71 FomulaSimplifications, 5 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 1239 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 06:12:48,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...