/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-fb4f59a-m [2022-04-28 03:12:10,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:12:10,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:12:10,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:12:10,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:12:10,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:12:10,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:12:10,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:12:10,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:12:10,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:12:10,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:12:10,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:12:10,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:12:10,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:12:10,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:12:10,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:12:10,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:12:10,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:12:10,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:12:10,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:12:10,195 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:12:10,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:12:10,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:12:10,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:12:10,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:12:10,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:12:10,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:12:10,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:12:10,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:12:10,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:12:10,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:12:10,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:12:10,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:12:10,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:12:10,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:12:10,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:12:10,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:12:10,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:12:10,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:12:10,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:12:10,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:12:10,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:12:10,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:12:10,227 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:12:10,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:12:10,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:12:10,229 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:12:10,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:12:10,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:12:10,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:12:10,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:12:10,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:12:10,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:12:10,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:12:10,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:12:10,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:12:10,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:12:10,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:12:10,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:12:10,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:12:10,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:12:10,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:12:10,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:12:10,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:12:10,232 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:12:10,232 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:12:10,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:12:10,232 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:12:10,233 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-28 03:12:10,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:12:10,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:12:10,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:12:10,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:12:10,481 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:12:10,482 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-28 03:12:10,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4005edb84/229c2e8f943c4d1485ee4bd7cbc6767a/FLAGeace86cd6 [2022-04-28 03:12:10,874 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:12:10,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013.i [2022-04-28 03:12:10,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4005edb84/229c2e8f943c4d1485ee4bd7cbc6767a/FLAGeace86cd6 [2022-04-28 03:12:10,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4005edb84/229c2e8f943c4d1485ee4bd7cbc6767a [2022-04-28 03:12:10,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:12:10,894 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:12:10,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:12:10,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:12:10,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:12:10,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:10" (1/1) ... [2022-04-28 03:12:10,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f4e682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:10, skipping insertion in model container [2022-04-28 03:12:10,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:10" (1/1) ... [2022-04-28 03:12:10,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:12:10,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:12:11,061 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-28 03:12:11,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:12:11,083 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:12:11,094 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-28 03:12:11,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:12:11,110 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:12:11,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11 WrapperNode [2022-04-28 03:12:11,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:12:11,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:12:11,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:12:11,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:12:11,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11" (1/1) ... [2022-04-28 03:12:11,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11" (1/1) ... [2022-04-28 03:12:11,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11" (1/1) ... [2022-04-28 03:12:11,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11" (1/1) ... [2022-04-28 03:12:11,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11" (1/1) ... [2022-04-28 03:12:11,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11" (1/1) ... [2022-04-28 03:12:11,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11" (1/1) ... [2022-04-28 03:12:11,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:12:11,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:12:11,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:12:11,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:12:11,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11" (1/1) ... [2022-04-28 03:12:11,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:12:11,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:11,174 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-28 03:12:11,193 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-28 03:12:11,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:12:11,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:12:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:12:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:12:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:12:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:12:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:12:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:12:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:12:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:12:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:12:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:12:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:12:11,266 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:12:11,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:12:11,383 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:12:11,390 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:12:11,390 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:12:11,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:11 BoogieIcfgContainer [2022-04-28 03:12:11,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:12:11,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:12:11,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:12:11,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:12:11,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:12:10" (1/3) ... [2022-04-28 03:12:11,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731f1c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:11, skipping insertion in model container [2022-04-28 03:12:11,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:11" (2/3) ... [2022-04-28 03:12:11,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731f1c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:11, skipping insertion in model container [2022-04-28 03:12:11,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:11" (3/3) ... [2022-04-28 03:12:11,398 INFO L111 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2022-04-28 03:12:11,428 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:12:11,428 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:12:11,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:12:11,471 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3625d0fa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e0829dd [2022-04-28 03:12:11,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:12:11,493 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-28 03:12:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:12:11,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:11,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:11,501 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:11,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:11,508 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 1 times [2022-04-28 03:12:11,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:11,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [304090493] [2022-04-28 03:12:11,525 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash -948948446, now seen corresponding path program 2 times [2022-04-28 03:12:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:11,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578802038] [2022-04-28 03:12:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:11,703 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-28 03:12:11,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:12:11,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-28 03:12:11,709 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-28 03:12:11,710 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-28 03:12:11,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:12:11,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-28 03:12:11,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-28 03:12:11,711 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-28 03:12:11,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume 0 != ~flag~0;~i~0 := 0; {26#true} is VALID [2022-04-28 03:12:11,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-28 03:12:11,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 != ~flag~0; {27#false} is VALID [2022-04-28 03:12:11,716 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-28 03:12:11,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 03:12:11,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 03:12:11,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 03:12:11,720 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-28 03:12:11,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:11,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578802038] [2022-04-28 03:12:11,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578802038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:11,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:11,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:12:11,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:11,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [304090493] [2022-04-28 03:12:11,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [304090493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:11,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:11,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:12:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931746293] [2022-04-28 03:12:11,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:11,734 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-28 03:12:11,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:11,740 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-28 03:12:11,775 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-28 03:12:11,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:12:11,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:12:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:12:11,809 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-28 03:12:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:11,930 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 03:12:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:12:11,931 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-28 03:12:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:11,937 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-28 03:12:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-28 03:12:11,948 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-28 03:12:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-28 03:12:11,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-04-28 03:12:12,020 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-28 03:12:12,029 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:12:12,030 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:12:12,033 INFO L412 NwaCegarLoop]: 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-28 03:12:12,039 INFO L413 NwaCegarLoop]: 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-28 03:12:12,041 INFO L414 NwaCegarLoop]: 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-28 03:12:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:12:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:12:12,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:12,078 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-28 03:12:12,078 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-28 03:12:12,078 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-28 03:12:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:12,083 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:12:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:12:12,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:12,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:12,084 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-28 03:12:12,084 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-28 03:12:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:12,088 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:12:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:12:12,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:12,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:12,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:12,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:12,090 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-28 03:12:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 03:12:12,098 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-28 03:12:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:12,101 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 03:12:12,106 INFO L496 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-28 03:12:12,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 03:12:12,134 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-28 03:12:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:12:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:12:12,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:12,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:12,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:12:12,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 1 times [2022-04-28 03:12:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:12,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [404039161] [2022-04-28 03:12:12,144 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:12,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1572998999, now seen corresponding path program 2 times [2022-04-28 03:12:12,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:12,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435255714] [2022-04-28 03:12:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:12,357 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-28 03:12:12,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-28 03:12:12,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #68#return; {170#true} is VALID [2022-04-28 03:12:12,358 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-28 03:12:12,358 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-28 03:12:12,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-28 03:12:12,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #68#return; {170#true} is VALID [2022-04-28 03:12:12,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret5 := main(); {170#true} is VALID [2022-04-28 03:12:12,360 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-28 03:12:12,360 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-28 03:12:12,361 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-28 03:12:12,361 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-28 03:12:12,363 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-28 03:12:12,364 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-28 03:12:12,364 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-28 03:12:12,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {177#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {171#false} is VALID [2022-04-28 03:12:12,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {171#false} assume !false; {171#false} is VALID [2022-04-28 03:12:12,366 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-28 03:12:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:12,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435255714] [2022-04-28 03:12:12,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435255714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:12,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:12,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:12:12,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:12,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [404039161] [2022-04-28 03:12:12,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [404039161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:12,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:12,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:12:12,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090208930] [2022-04-28 03:12:12,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:12,369 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-28 03:12:12,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:12,384 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-28 03:12:12,410 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-28 03:12:12,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:12:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:12,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:12:12,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:12:12,413 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-28 03:12:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:12,578 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 03:12:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:12:12,580 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-28 03:12:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:12,581 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-28 03:12:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 03:12:12,583 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-28 03:12:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 03:12:12,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-28 03:12:12,612 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-28 03:12:12,613 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:12:12,614 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:12:12,614 INFO L412 NwaCegarLoop]: 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-28 03:12:12,616 INFO L413 NwaCegarLoop]: 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-28 03:12:12,617 INFO L414 NwaCegarLoop]: 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-28 03:12:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:12:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:12:12,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:12,621 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-28 03:12:12,622 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-28 03:12:12,622 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-28 03:12:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:12,623 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:12:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:12:12,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:12,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:12,624 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-28 03:12:12,624 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-28 03:12:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:12,626 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:12:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:12:12,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:12,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:12,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:12,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:12,627 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-28 03:12:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 03:12:12,628 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-28 03:12:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:12,628 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 03:12:12,629 INFO L496 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-28 03:12:12,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 03:12:12,651 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-28 03:12:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:12:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:12:12,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:12,653 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:12,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:12:12,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:12,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:12,656 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 1 times [2022-04-28 03:12:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:12,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [946732046] [2022-04-28 03:12:12,660 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash -898740055, now seen corresponding path program 2 times [2022-04-28 03:12:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:12,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147475957] [2022-04-28 03:12:12,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:12,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:13,009 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-28 03:12:13,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 03:12:13,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-28 03:12:13,011 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-28 03:12:13,011 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-28 03:12:13,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 03:12:13,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-28 03:12:13,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-28 03:12:13,012 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-28 03:12:13,013 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-28 03:12:13,014 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-28 03:12:13,015 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-28 03:12:13,016 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-28 03:12:13,016 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-28 03:12:13,017 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-28 03:12:13,018 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-28 03:12:13,019 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-28 03:12:13,020 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-28 03:12:13,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {317#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {308#false} is VALID [2022-04-28 03:12:13,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-28 03:12:13,021 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-28 03:12:13,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:13,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147475957] [2022-04-28 03:12:13,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147475957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:13,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274402252] [2022-04-28 03:12:13,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:12:13,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:13,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:13,027 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-28 03:12:13,067 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-28 03:12:13,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:12:13,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:13,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 03:12:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:13,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:13,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-28 03:12:13,305 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-28 03:12:13,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 03:12:13,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-28 03:12:13,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-28 03:12:13,307 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-28 03:12:13,307 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-28 03:12:13,308 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-28 03:12:13,309 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-28 03:12:13,309 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-28 03:12:13,310 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-28 03:12:13,311 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-28 03:12:13,311 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-28 03:12:13,312 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-28 03:12:13,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:13,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-28 03:12:13,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-28 03:12:13,314 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-28 03:12:13,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:13,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-28 03:12:13,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {308#false} is VALID [2022-04-28 03:12:13,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:13,486 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-28 03:12:13,486 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-28 03:12:13,487 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-28 03:12:13,487 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-28 03:12:13,488 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-28 03:12:13,491 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-28 03:12:13,492 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-28 03:12:13,493 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-28 03:12:13,494 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-28 03:12:13,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret5 := main(); {307#true} is VALID [2022-04-28 03:12:13,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #68#return; {307#true} is VALID [2022-04-28 03:12:13,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2022-04-28 03:12:13,495 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-28 03:12:13,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-28 03:12:13,495 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-28 03:12:13,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274402252] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:13,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:13,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-28 03:12:13,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:13,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [946732046] [2022-04-28 03:12:13,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [946732046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:13,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:13,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:12:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051089838] [2022-04-28 03:12:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:13,497 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-28 03:12:13,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:13,498 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-28 03:12:13,514 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-28 03:12:13,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:12:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:13,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:12:13,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:12:13,516 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-28 03:12:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:13,800 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:12:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:12:13,801 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-28 03:12:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:13,801 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-28 03:12:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 03:12:13,803 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-28 03:12:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-28 03:12:13,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-28 03:12:13,847 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-28 03:12:13,848 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:12:13,848 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:12:13,849 INFO L412 NwaCegarLoop]: 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-28 03:12:13,853 INFO L413 NwaCegarLoop]: 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-28 03:12:13,857 INFO L414 NwaCegarLoop]: 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-28 03:12:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:12:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-28 03:12:13,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:13,870 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-28 03:12:13,871 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-28 03:12:13,871 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-28 03:12:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:13,873 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 03:12:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:12:13,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:13,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:13,874 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-28 03:12:13,874 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-28 03:12:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:13,881 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 03:12:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:12:13,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:13,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:13,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:13,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:13,884 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-28 03:12:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 03:12:13,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-04-28 03:12:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:13,886 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 03:12:13,886 INFO L496 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-28 03:12:13,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 03:12:13,914 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-28 03:12:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:12:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:12:13,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:13,915 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:13,941 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-28 03:12:14,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:14,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:14,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 1 times [2022-04-28 03:12:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:14,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315043060] [2022-04-28 03:12:14,135 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:14,135 INFO L85 PathProgramCache]: Analyzing trace with hash -197675477, now seen corresponding path program 2 times [2022-04-28 03:12:14,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:14,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862102776] [2022-04-28 03:12:14,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:14,186 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-28 03:12:14,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-28 03:12:14,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #68#return; {584#true} is VALID [2022-04-28 03:12:14,199 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-28 03:12:14,200 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-28 03:12:14,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-28 03:12:14,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {584#true} {584#true} #68#return; {584#true} is VALID [2022-04-28 03:12:14,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {584#true} call #t~ret5 := main(); {584#true} is VALID [2022-04-28 03:12:14,201 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-28 03:12:14,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} assume !(0 != ~flag~0);~i~0 := 1; {589#(= main_~flag~0 0)} is VALID [2022-04-28 03:12:14,202 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-28 03:12:14,202 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-28 03:12:14,203 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-28 03:12:14,203 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-28 03:12:14,204 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-28 03:12:14,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {589#(= main_~flag~0 0)} assume 0 != ~flag~0; {585#false} is VALID [2022-04-28 03:12:14,204 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-28 03:12:14,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {585#false} ~cond := #in~cond; {585#false} is VALID [2022-04-28 03:12:14,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#false} assume 0 == ~cond; {585#false} is VALID [2022-04-28 03:12:14,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-04-28 03:12:14,205 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-28 03:12:14,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:14,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862102776] [2022-04-28 03:12:14,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862102776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:14,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:14,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:12:14,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:14,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315043060] [2022-04-28 03:12:14,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315043060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:14,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:14,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:12:14,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087419426] [2022-04-28 03:12:14,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:14,207 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-28 03:12:14,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:14,208 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-28 03:12:14,220 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-28 03:12:14,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:12:14,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:14,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:12:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:12:14,221 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-28 03:12:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:14,280 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 03:12:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:12:14,280 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-28 03:12:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:14,281 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-28 03:12:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 03:12:14,282 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-28 03:12:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 03:12:14,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 03:12:14,307 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-28 03:12:14,308 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:12:14,308 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:12:14,308 INFO L412 NwaCegarLoop]: 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-28 03:12:14,309 INFO L413 NwaCegarLoop]: 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-28 03:12:14,309 INFO L414 NwaCegarLoop]: 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-28 03:12:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:12:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:12:14,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:14,319 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-28 03:12:14,319 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-28 03:12:14,319 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-28 03:12:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:14,320 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:12:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:12:14,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:14,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:14,321 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-28 03:12:14,321 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-28 03:12:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:14,322 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:12:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:12:14,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:14,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:14,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:14,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:14,323 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-28 03:12:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 03:12:14,324 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-28 03:12:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:14,324 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 03:12:14,324 INFO L496 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-28 03:12:14,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 03:12:14,348 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-28 03:12:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:12:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:12:14,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:14,349 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:14,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:12:14,350 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:14,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 3 times [2022-04-28 03:12:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:14,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698652533] [2022-04-28 03:12:14,351 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash 737392151, now seen corresponding path program 4 times [2022-04-28 03:12:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:14,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786939544] [2022-04-28 03:12:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:14,566 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-28 03:12:14,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-28 03:12:14,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-28 03:12:14,567 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-28 03:12:14,569 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-28 03:12:14,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-28 03:12:14,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-28 03:12:14,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-28 03:12:14,571 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-28 03:12:14,584 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-28 03:12:14,585 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-28 03:12:14,586 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-28 03:12:14,586 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-28 03:12:14,587 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-28 03:12:14,588 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-28 03:12:14,589 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-28 03:12:14,589 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-28 03:12:14,590 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-28 03:12:14,591 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-28 03:12:14,592 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-28 03:12:14,592 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-28 03:12:14,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {744#false} is VALID [2022-04-28 03:12:14,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-28 03:12:14,593 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-28 03:12:14,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:14,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786939544] [2022-04-28 03:12:14,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786939544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:14,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999672271] [2022-04-28 03:12:14,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:12:14,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:14,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:14,595 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-28 03:12:14,604 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-28 03:12:14,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:12:14,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:14,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 03:12:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:14,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:14,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-28 03:12:14,893 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-28 03:12:14,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-28 03:12:14,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-28 03:12:14,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-28 03:12:14,894 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-28 03:12:14,895 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-28 03:12:14,895 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-28 03:12:14,896 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-28 03:12:14,896 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-28 03:12:14,897 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-28 03:12:14,898 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-28 03:12:14,898 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-28 03:12:14,899 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-28 03:12:14,899 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-28 03:12:14,900 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-28 03:12:14,900 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-28 03:12:14,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:14,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-28 03:12:14,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-28 03:12:14,901 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-28 03:12:14,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:15,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-28 03:12:15,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-28 03:12:15,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:15,163 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-28 03:12:15,163 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-28 03:12:15,165 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-28 03:12:15,166 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-28 03:12:15,166 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-28 03:12:15,168 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-28 03:12:15,169 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-28 03:12:15,170 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-28 03:12:15,172 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-28 03:12:15,172 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-28 03:12:15,173 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-28 03:12:15,173 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-28 03:12:15,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2022-04-28 03:12:15,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #68#return; {743#true} is VALID [2022-04-28 03:12:15,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-28 03:12:15,174 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-28 03:12:15,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-28 03:12:15,174 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-28 03:12:15,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999672271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:15,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:15,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-28 03:12:15,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:15,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698652533] [2022-04-28 03:12:15,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698652533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:15,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:15,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:12:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762402231] [2022-04-28 03:12:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:15,175 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-28 03:12:15,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:15,176 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-28 03:12:15,193 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-28 03:12:15,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:12:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:15,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:12:15,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:12:15,194 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-28 03:12:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:15,659 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 03:12:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:12:15,659 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-28 03:12:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:15,659 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-28 03:12:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 03:12:15,661 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-28 03:12:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 03:12:15,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-28 03:12:15,700 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-28 03:12:15,701 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:12:15,701 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 03:12:15,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:12:15,702 INFO L413 NwaCegarLoop]: 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-28 03:12:15,702 INFO L414 NwaCegarLoop]: 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-28 03:12:15,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 03:12:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 03:12:15,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:15,734 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-28 03:12:15,734 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-28 03:12:15,734 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-28 03:12:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:15,735 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 03:12:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 03:12:15,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:15,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:15,736 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-28 03:12:15,736 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-28 03:12:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:15,737 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 03:12:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 03:12:15,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:15,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:15,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:15,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:15,738 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-28 03:12:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-28 03:12:15,739 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-04-28 03:12:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:15,739 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-28 03:12:15,739 INFO L496 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-28 03:12:15,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-28 03:12:15,767 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-28 03:12:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 03:12:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:12:15,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:15,768 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:15,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 03:12:15,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:15,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -831901207, now seen corresponding path program 5 times [2022-04-28 03:12:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:15,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285392218] [2022-04-28 03:12:15,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -831901207, now seen corresponding path program 6 times [2022-04-28 03:12:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:15,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209757187] [2022-04-28 03:12:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:16,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:16,254 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-28 03:12:16,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-28 03:12:16,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-28 03:12:16,256 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-28 03:12:16,256 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-28 03:12:16,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-28 03:12:16,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-28 03:12:16,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-28 03:12:16,258 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-28 03:12:16,259 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-28 03:12:16,259 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-28 03:12:16,260 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-28 03:12:16,261 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-28 03:12:16,261 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-28 03:12:16,262 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-28 03:12:16,264 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-28 03:12:16,264 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-28 03:12:16,266 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-28 03:12:16,267 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-28 03:12:16,267 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-28 03:12:16,268 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-28 03:12:16,268 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-28 03:12:16,269 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-28 03:12:16,270 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-28 03:12:16,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {1086#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1074#false} is VALID [2022-04-28 03:12:16,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-28 03:12:16,271 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-28 03:12:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:16,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209757187] [2022-04-28 03:12:16,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209757187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:16,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11481707] [2022-04-28 03:12:16,272 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:12:16,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:16,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:16,276 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-28 03:12:16,278 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-28 03:12:16,324 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 03:12:16,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:16,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 03:12:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:16,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:16,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2022-04-28 03:12:16,616 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-28 03:12:16,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-28 03:12:16,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-28 03:12:16,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-28 03:12:16,620 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-28 03:12:16,621 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-28 03:12:16,621 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-28 03:12:16,622 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-28 03:12:16,623 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-28 03:12:16,623 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-28 03:12:16,624 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-28 03:12:16,624 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-28 03:12:16,625 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-28 03:12:16,625 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-28 03:12:16,626 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-28 03:12:16,626 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-28 03:12:16,627 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-28 03:12:16,627 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-28 03:12:16,628 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-28 03:12:16,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:16,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1074#false} is VALID [2022-04-28 03:12:16,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-28 03:12:16,629 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-28 03:12:16,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:16,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2022-04-28 03:12:16,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1074#false} is VALID [2022-04-28 03:12:16,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:16,964 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-28 03:12:16,965 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-28 03:12:16,965 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-28 03:12:16,965 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-28 03:12:16,966 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-28 03:12:16,967 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-28 03:12:16,968 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-28 03:12:16,970 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-28 03:12:16,972 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-28 03:12:16,973 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-28 03:12:16,974 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-28 03:12:16,976 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-28 03:12:16,977 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-28 03:12:16,977 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-28 03:12:16,978 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-28 03:12:16,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret5 := main(); {1073#true} is VALID [2022-04-28 03:12:16,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #68#return; {1073#true} is VALID [2022-04-28 03:12:16,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2022-04-28 03:12:16,978 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-28 03:12:16,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2022-04-28 03:12:16,979 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-28 03:12:16,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11481707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:16,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:16,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-04-28 03:12:16,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:16,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285392218] [2022-04-28 03:12:16,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285392218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:16,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:16,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:12:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321531986] [2022-04-28 03:12:16,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:16,980 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-28 03:12:16,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:16,981 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-28 03:12:17,009 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-28 03:12:17,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:12:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:17,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:12:17,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:12:17,010 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-28 03:12:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:17,635 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-28 03:12:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:12:17,636 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-28 03:12:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:17,636 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-28 03:12:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-28 03:12:17,637 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-28 03:12:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-04-28 03:12:17,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 36 transitions. [2022-04-28 03:12:17,680 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-28 03:12:17,681 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:12:17,681 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:12:17,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:12:17,682 INFO L413 NwaCegarLoop]: 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-28 03:12:17,683 INFO L414 NwaCegarLoop]: 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-28 03:12:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:12:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-28 03:12:17,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:17,714 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-28 03:12:17,714 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-28 03:12:17,714 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-28 03:12:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:17,715 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:12:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:12:17,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:17,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:17,716 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-28 03:12:17,716 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-28 03:12:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:17,717 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:12:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:12:17,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:17,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:17,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:17,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:17,718 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-28 03:12:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 03:12:17,719 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-28 03:12:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:17,719 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 03:12:17,719 INFO L496 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-28 03:12:17,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 03:12:17,755 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-28 03:12:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 03:12:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:12:17,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:17,756 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:17,786 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-28 03:12:17,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:17,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 1 times [2022-04-28 03:12:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:17,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1791693745] [2022-04-28 03:12:17,958 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash -130836629, now seen corresponding path program 2 times [2022-04-28 03:12:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:17,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497906034] [2022-04-28 03:12:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:18,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:18,073 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-28 03:12:18,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-28 03:12:18,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-28 03:12:18,075 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-28 03:12:18,075 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-28 03:12:18,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-28 03:12:18,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-28 03:12:18,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-28 03:12:18,076 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-28 03:12:18,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1444#(= main_~i~0 0)} is VALID [2022-04-28 03:12:18,078 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-28 03:12:18,078 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-28 03:12:18,079 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-28 03:12:18,082 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-28 03:12:18,083 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-28 03:12:18,084 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-28 03:12:18,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 03:12:18,084 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-28 03:12:18,084 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-28 03:12:18,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 03:12:18,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-28 03:12:18,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-28 03:12:18,085 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-28 03:12:18,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-28 03:12:18,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-28 03:12:18,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-28 03:12:18,085 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-28 03:12:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:18,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497906034] [2022-04-28 03:12:18,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497906034] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:18,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521130415] [2022-04-28 03:12:18,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:12:18,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:18,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:18,087 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-28 03:12:18,088 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-28 03:12:18,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:12:18,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:18,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:12:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:18,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:18,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2022-04-28 03:12:18,397 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-28 03:12:18,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-28 03:12:18,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-28 03:12:18,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-28 03:12:18,398 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-28 03:12:18,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {1439#true} assume 0 != ~flag~0;~i~0 := 0; {1444#(= main_~i~0 0)} is VALID [2022-04-28 03:12:18,399 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-28 03:12:18,400 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-28 03:12:18,400 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-28 03:12:18,401 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-28 03:12:18,402 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-28 03:12:18,403 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-28 03:12:18,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 03:12:18,403 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-28 03:12:18,403 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-28 03:12:18,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 03:12:18,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-28 03:12:18,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-28 03:12:18,403 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-28 03:12:18,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-28 03:12:18,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-28 03:12:18,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-28 03:12:18,406 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-28 03:12:18,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:18,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2022-04-28 03:12:18,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#false} assume 0 == ~cond; {1440#false} is VALID [2022-04-28 03:12:18,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {1440#false} ~cond := #in~cond; {1440#false} is VALID [2022-04-28 03:12:18,470 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-28 03:12:18,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {1440#false} assume 0 != ~flag~0; {1440#false} is VALID [2022-04-28 03:12:18,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#false} assume !(0 != #t~nondet2);havoc #t~nondet2; {1440#false} is VALID [2022-04-28 03:12:18,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 03:12:18,471 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-28 03:12:18,471 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-28 03:12:18,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#false} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1440#false} is VALID [2022-04-28 03:12:18,471 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-28 03:12:18,472 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-28 03:12:18,473 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-28 03:12:18,474 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-28 03:12:18,475 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-28 03:12:18,475 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-28 03:12:18,475 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-28 03:12:18,476 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-28 03:12:18,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret5 := main(); {1439#true} is VALID [2022-04-28 03:12:18,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #68#return; {1439#true} is VALID [2022-04-28 03:12:18,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2022-04-28 03:12:18,477 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-28 03:12:18,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2022-04-28 03:12:18,477 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-28 03:12:18,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521130415] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:18,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:12:18,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 5] total 8 [2022-04-28 03:12:18,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:18,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1791693745] [2022-04-28 03:12:18,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1791693745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:18,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:18,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:12:18,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276311659] [2022-04-28 03:12:18,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:18,479 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-28 03:12:18,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:18,479 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-28 03:12:18,493 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-28 03:12:18,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:12:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:12:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:12:18,494 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-28 03:12:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:18,541 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-28 03:12:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:12:18,542 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-28 03:12:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:18,542 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-28 03:12:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-28 03:12:18,543 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-28 03:12:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-28 03:12:18,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-04-28 03:12:18,564 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-28 03:12:18,565 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:12:18,565 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:12:18,565 INFO L412 NwaCegarLoop]: 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-28 03:12:18,566 INFO L413 NwaCegarLoop]: 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-28 03:12:18,566 INFO L414 NwaCegarLoop]: 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-28 03:12:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:12:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:12:18,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:18,597 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-28 03:12:18,597 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-28 03:12:18,597 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-28 03:12:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:18,598 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:12:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:12:18,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:18,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:18,599 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-28 03:12:18,599 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-28 03:12:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:18,600 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:12:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:12:18,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:18,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:18,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:18,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:18,601 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-28 03:12:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 03:12:18,602 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2022-04-28 03:12:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:18,602 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 03:12:18,602 INFO L496 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-28 03:12:18,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 03:12:18,633 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-28 03:12:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:12:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:12:18,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:18,634 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:18,663 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-28 03:12:18,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:18,855 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash -931312425, now seen corresponding path program 7 times [2022-04-28 03:12:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:18,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [762624455] [2022-04-28 03:12:18,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash -931312425, now seen corresponding path program 8 times [2022-04-28 03:12:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:18,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028499021] [2022-04-28 03:12:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,134 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-28 03:12:19,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 03:12:19,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-28 03:12:19,135 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-28 03:12:19,135 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-28 03:12:19,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 03:12:19,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-28 03:12:19,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-28 03:12:19,136 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-28 03:12:19,136 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-28 03:12:19,137 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-28 03:12:19,137 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-28 03:12:19,138 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-28 03:12:19,139 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-28 03:12:19,140 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-28 03:12:19,140 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-28 03:12:19,141 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-28 03:12:19,141 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-28 03:12:19,142 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-28 03:12:19,143 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-28 03:12:19,143 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-28 03:12:19,144 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-28 03:12:19,145 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-28 03:12:19,148 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-28 03:12:19,149 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-28 03:12:19,150 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-28 03:12:19,150 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-28 03:12:19,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {1786#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1772#false} is VALID [2022-04-28 03:12:19,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-28 03:12:19,151 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-28 03:12:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:19,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028499021] [2022-04-28 03:12:19,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028499021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:19,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925899970] [2022-04-28 03:12:19,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:12:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:19,153 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-28 03:12:19,160 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-28 03:12:19,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:12:19,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:19,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 03:12:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:19,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:19,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-28 03:12:19,606 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-28 03:12:19,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 03:12:19,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-28 03:12:19,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-28 03:12:19,607 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-28 03:12:19,607 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-28 03:12:19,608 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-28 03:12:19,608 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-28 03:12:19,609 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-28 03:12:19,609 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-28 03:12:19,609 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-28 03:12:19,610 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-28 03:12:19,610 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-28 03:12:19,611 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-28 03:12:19,611 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-28 03:12:19,612 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-28 03:12:19,612 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-28 03:12:19,613 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-28 03:12:19,613 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-28 03:12:19,613 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-28 03:12:19,614 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-28 03:12:19,614 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-28 03:12:19,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1868#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:19,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {1868#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-28 03:12:19,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-28 03:12:19,616 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-28 03:12:19,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:20,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {1772#false} assume !false; {1772#false} is VALID [2022-04-28 03:12:20,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {1868#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1772#false} is VALID [2022-04-28 03:12:20,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {1864#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1868#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:20,021 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-28 03:12:20,022 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-28 03:12:20,022 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-28 03:12:20,022 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-28 03:12:20,023 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-28 03:12:20,024 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-28 03:12:20,025 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-28 03:12:20,026 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-28 03:12:20,027 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-28 03:12:20,028 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-28 03:12:20,029 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-28 03:12:20,030 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-28 03:12:20,030 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-28 03:12:20,031 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-28 03:12:20,033 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-28 03:12:20,033 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-28 03:12:20,034 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-28 03:12:20,034 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-28 03:12:20,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {1771#true} call #t~ret5 := main(); {1771#true} is VALID [2022-04-28 03:12:20,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1771#true} {1771#true} #68#return; {1771#true} is VALID [2022-04-28 03:12:20,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {1771#true} assume true; {1771#true} is VALID [2022-04-28 03:12:20,035 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-28 03:12:20,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {1771#true} call ULTIMATE.init(); {1771#true} is VALID [2022-04-28 03:12:20,035 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-28 03:12:20,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925899970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:20,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:20,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32 [2022-04-28 03:12:20,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:20,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [762624455] [2022-04-28 03:12:20,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [762624455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:20,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:20,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:12:20,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105789522] [2022-04-28 03:12:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:20,037 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-28 03:12:20,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:20,037 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-28 03:12:20,061 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-28 03:12:20,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:12:20,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:20,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:12:20,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:12:20,062 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-28 03:12:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:20,555 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:12:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:12:20,555 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-28 03:12:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:20,555 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-28 03:12:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2022-04-28 03:12:20,556 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-28 03:12:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2022-04-28 03:12:20,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 19 transitions. [2022-04-28 03:12:20,584 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-28 03:12:20,585 INFO L225 Difference]: With dead ends: 27 [2022-04-28 03:12:20,585 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:12:20,586 INFO L412 NwaCegarLoop]: 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-28 03:12:20,586 INFO L413 NwaCegarLoop]: 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-28 03:12:20,586 INFO L414 NwaCegarLoop]: 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-28 03:12:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:12:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:12:20,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:20,587 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-28 03:12:20,587 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-28 03:12:20,588 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-28 03:12:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:20,589 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:12:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:12:20,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:20,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:20,589 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-28 03:12:20,589 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-28 03:12:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:20,589 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:12:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:12:20,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:20,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:20,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:20,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:20,590 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-28 03:12:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:12:20,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-28 03:12:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:20,590 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:12:20,590 INFO L496 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-28 03:12:20,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:12:20,590 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-28 03:12:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:12:20,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:20,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:12:20,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 03:12:20,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:20,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:12:21,119 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 03:12:21,119 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 03:12:21,119 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 03:12:21,119 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 03:12:21,119 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:12:21,119 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:12:21,119 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:12:21,119 INFO L895 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-28 03:12:21,119 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 49) the Hoare annotation is: true [2022-04-28 03:12:21,120 INFO L895 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-28 03:12:21,120 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 49) the Hoare annotation is: true [2022-04-28 03:12:21,120 INFO L895 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-28 03:12:21,120 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 49) the Hoare annotation is: true [2022-04-28 03:12:21,120 INFO L902 garLoopResultBuilder]: At program point L45(lines 45 47) the Hoare annotation is: true [2022-04-28 03:12:21,120 INFO L895 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-28 03:12:21,120 INFO L895 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-28 03:12:21,120 INFO L895 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-28 03:12:21,120 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:12:21,120 INFO L895 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-28 03:12:21,120 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:12:21,120 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:12:21,120 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:12:21,120 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:12:21,121 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:12:21,121 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 03:12:21,121 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 03:12:21,121 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 03:12:21,121 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:12:21,121 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:12:21,121 INFO L895 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-28 03:12:21,124 INFO L356 BasicCegarLoop]: Path program histogram: [8, 2, 2, 2, 2] [2022-04-28 03:12:21,125 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:12:21,127 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:12:21,127 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:12:21,136 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:12:21,137 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:12:21,137 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:12:21,137 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:12:21,139 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:12:21,155 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-28 03:12:21,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:12:21 BoogieIcfgContainer [2022-04-28 03:12:21,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:12:21,162 INFO L158 Benchmark]: Toolchain (without parser) took 10267.18ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 120.7MB in the beginning and 98.2MB in the end (delta: 22.5MB). Peak memory consumption was 56.4MB. Max. memory is 8.0GB. [2022-04-28 03:12:21,162 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 137.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:12:21,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.50ms. Allocated memory is still 169.9MB. Free memory was 120.5MB in the beginning and 145.8MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 03:12:21,162 INFO L158 Benchmark]: Boogie Preprocessor took 28.89ms. Allocated memory is still 169.9MB. Free memory was 145.3MB in the beginning and 143.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:12:21,163 INFO L158 Benchmark]: RCFGBuilder took 250.27ms. Allocated memory is still 169.9MB. Free memory was 143.8MB in the beginning and 132.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:12:21,163 INFO L158 Benchmark]: TraceAbstraction took 9767.86ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 132.3MB in the beginning and 98.2MB in the end (delta: 34.1MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. [2022-04-28 03:12:21,165 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.13ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 137.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.50ms. Allocated memory is still 169.9MB. Free memory was 120.5MB in the beginning and 145.8MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.89ms. Allocated memory is still 169.9MB. Free memory was 145.3MB in the beginning and 143.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.27ms. Allocated memory is still 169.9MB. Free memory was 143.8MB in the beginning and 132.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9767.86ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 132.3MB in the beginning and 98.2MB in the end (delta: 34.1MB). Peak memory consumption was 69.6MB. 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: 9.7s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.5s 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, 2.1s 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-28 03:12:21,187 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...