/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:27:10,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:27:10,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:27:10,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:27:10,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:27:10,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:27:10,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:27:10,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:27:10,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:27:10,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:27:10,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:27:10,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:27:10,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:27:10,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:27:10,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:27:10,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:27:10,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:27:10,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:27:10,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:27:10,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:27:10,229 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:27:10,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:27:10,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:27:10,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:27:10,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:27:10,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:27:10,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:27:10,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:27:10,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:27:10,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:27:10,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:27:10,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:27:10,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:27:10,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:27:10,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:27:10,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:27:10,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:27:10,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:27:10,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:27:10,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:27:10,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:27:10,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:27:10,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:27:10,280 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:27:10,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:27:10,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:27:10,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:27:10,281 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:27:10,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:27:10,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:27:10,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:27:10,282 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:27:10,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:27:10,283 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:27:10,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:27:10,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:27:10,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:27:10,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:27:10,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:27:10,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:27:10,287 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:27:10,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:27:10,287 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:27:10,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:27:10,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:27:10,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:27:10,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:27:10,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:27:10,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:27:10,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:27:10,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:27:10,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:27:10,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:27:10,289 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:27:10,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:27:10,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:27:10,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:27:10,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:27:10,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:27:10,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:27:10,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:27:10,508 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:27:10,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-27 11:27:10,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059468eaa/55757b43a95542cf94e34175ef9b205a/FLAGf594b29f4 [2022-04-27 11:27:10,884 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:27:10,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-27 11:27:10,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059468eaa/55757b43a95542cf94e34175ef9b205a/FLAGf594b29f4 [2022-04-27 11:27:11,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059468eaa/55757b43a95542cf94e34175ef9b205a [2022-04-27 11:27:11,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:27:11,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:27:11,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:27:11,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:27:11,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:27:11,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55889994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11, skipping insertion in model container [2022-04-27 11:27:11,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:27:11,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:27:11,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c[321,334] [2022-04-27 11:27:11,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:27:11,506 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:27:11,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c[321,334] [2022-04-27 11:27:11,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:27:11,551 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:27:11,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11 WrapperNode [2022-04-27 11:27:11,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:27:11,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:27:11,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:27:11,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:27:11,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:27:11,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:27:11,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:27:11,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:27:11,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11" (1/1) ... [2022-04-27 11:27:11,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:27:11,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:11,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:27:11,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:27:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:27:11,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:27:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:27:11,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:27:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:27:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:27:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:27:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:27:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:27:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:27:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:27:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:27:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:27:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:27:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:27:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:27:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:27:11,719 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:27:11,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:27:11,831 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:27:11,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:27:11,836 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 11:27:11,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:27:11 BoogieIcfgContainer [2022-04-27 11:27:11,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:27:11,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:27:11,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:27:11,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:27:11,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:27:11" (1/3) ... [2022-04-27 11:27:11,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc83471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:27:11, skipping insertion in model container [2022-04-27 11:27:11,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:11" (2/3) ... [2022-04-27 11:27:11,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc83471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:27:11, skipping insertion in model container [2022-04-27 11:27:11,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:27:11" (3/3) ... [2022-04-27 11:27:11,845 INFO L111 eAbstractionObserver]: Analyzing ICFG nested3-2.c [2022-04-27 11:27:11,858 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:27:11,859 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:27:11,904 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:27:11,910 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b1da14f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@63e77d8 [2022-04-27 11:27:11,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:27:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:27:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:27:11,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:11,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:11,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1794590667, now seen corresponding path program 1 times [2022-04-27 11:27:11,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:11,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684052026] [2022-04-27 11:27:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:12,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:12,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(12, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-27 11:27:12,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:27:12,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-27 11:27:12,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:12,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(12, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-27 11:27:12,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:27:12,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-27 11:27:12,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret7 := main(); {28#true} is VALID [2022-04-27 11:27:12,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {28#true} is VALID [2022-04-27 11:27:12,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-27 11:27:12,100 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-27 11:27:12,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-27 11:27:12,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-27 11:27:12,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-27 11:27:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:12,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684052026] [2022-04-27 11:27:12,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684052026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:27:12,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:27:12,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:27:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514260653] [2022-04-27 11:27:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:27:12,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:27:12,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:12,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:12,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:27:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:27:12,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:27:12,190 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:12,314 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-27 11:27:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:27:12,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:27:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-27 11:27:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-27 11:27:12,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-27 11:27:12,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:12,437 INFO L225 Difference]: With dead ends: 44 [2022-04-27 11:27:12,437 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 11:27:12,440 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-27 11:27:12,443 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:12,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:27:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 11:27:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 11:27:12,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:12,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:12,475 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:12,475 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:12,479 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-27 11:27:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-27 11:27:12,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:12,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:12,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 11:27:12,480 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 11:27:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:12,483 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-27 11:27:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-27 11:27:12,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:12,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:12,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:12,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-27 11:27:12,488 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-04-27 11:27:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:12,488 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-27 11:27:12,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-27 11:27:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:27:12,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:12,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:12,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:27:12,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:12,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:12,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1824143339, now seen corresponding path program 1 times [2022-04-27 11:27:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:12,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564003671] [2022-04-27 11:27:12,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:12,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:12,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#(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(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-27 11:27:12,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-27 11:27:12,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #63#return; {169#true} is VALID [2022-04-27 11:27:12,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:12,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#(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(12, 2);call #Ultimate.allocInit(12, 3); {169#true} is VALID [2022-04-27 11:27:12,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} assume true; {169#true} is VALID [2022-04-27 11:27:12,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} #63#return; {169#true} is VALID [2022-04-27 11:27:12,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} call #t~ret7 := main(); {169#true} is VALID [2022-04-27 11:27:12,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {174#(= main_~x~0 0)} is VALID [2022-04-27 11:27:12,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {174#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {170#false} is VALID [2022-04-27 11:27:12,627 INFO L272 TraceCheckUtils]: 7: Hoare triple {170#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {170#false} is VALID [2022-04-27 11:27:12,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {170#false} ~cond := #in~cond; {170#false} is VALID [2022-04-27 11:27:12,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#false} assume 0 == ~cond; {170#false} is VALID [2022-04-27 11:27:12,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-04-27 11:27:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:12,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564003671] [2022-04-27 11:27:12,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564003671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:27:12,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:27:12,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:27:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210216183] [2022-04-27 11:27:12,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:27:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:27:12,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:12,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:12,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:27:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:12,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:27:12,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:27:12,646 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:12,800 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-27 11:27:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:27:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:27:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 11:27:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-27 11:27:12,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-27 11:27:12,870 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-27 11:27:12,878 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:27:12,879 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 11:27:12,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-27 11:27:12,886 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:12,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:27:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 11:27:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-04-27 11:27:12,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:12,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:12,897 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:12,897 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:12,903 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-27 11:27:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-27 11:27:12,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:12,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:12,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 11:27:12,905 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 11:27:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:12,909 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-27 11:27:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-27 11:27:12,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:12,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:12,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:12,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-27 11:27:12,915 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2022-04-27 11:27:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:12,916 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-27 11:27:12,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 11:27:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:27:12,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:12,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:12,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:27:12,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash -699512288, now seen corresponding path program 1 times [2022-04-27 11:27:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:12,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945713775] [2022-04-27 11:27:12,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:12,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:13,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#(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(12, 2);call #Ultimate.allocInit(12, 3); {319#true} is VALID [2022-04-27 11:27:13,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#true} assume true; {319#true} is VALID [2022-04-27 11:27:13,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {319#true} {319#true} #63#return; {319#true} is VALID [2022-04-27 11:27:13,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:13,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#(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(12, 2);call #Ultimate.allocInit(12, 3); {319#true} is VALID [2022-04-27 11:27:13,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} assume true; {319#true} is VALID [2022-04-27 11:27:13,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} #63#return; {319#true} is VALID [2022-04-27 11:27:13,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {319#true} call #t~ret7 := main(); {319#true} is VALID [2022-04-27 11:27:13,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {319#true} is VALID [2022-04-27 11:27:13,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {324#(= main_~y~0 0)} is VALID [2022-04-27 11:27:13,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {324#(= main_~y~0 0)} assume !(~y~0 % 4294967296 < 268435455); {320#false} is VALID [2022-04-27 11:27:13,014 INFO L272 TraceCheckUtils]: 8: Hoare triple {320#false} call __VERIFIER_assert((if 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {320#false} is VALID [2022-04-27 11:27:13,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#false} ~cond := #in~cond; {320#false} is VALID [2022-04-27 11:27:13,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {320#false} assume 0 == ~cond; {320#false} is VALID [2022-04-27 11:27:13,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {320#false} assume !false; {320#false} is VALID [2022-04-27 11:27:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:13,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945713775] [2022-04-27 11:27:13,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945713775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:27:13,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:27:13,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:27:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527921748] [2022-04-27 11:27:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:27:13,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:27:13,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:13,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:13,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:13,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:27:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:13,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:27:13,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:27:13,028 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:13,129 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-27 11:27:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:27:13,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:27:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 11:27:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 11:27:13,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-27 11:27:13,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:13,195 INFO L225 Difference]: With dead ends: 39 [2022-04-27 11:27:13,195 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 11:27:13,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-27 11:27:13,203 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:13,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:27:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 11:27:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-27 11:27:13,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:13,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:13,215 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:13,215 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:13,219 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-27 11:27:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-27 11:27:13,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:13,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:13,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 11:27:13,223 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 11:27:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:13,225 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-27 11:27:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-27 11:27:13,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:13,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:13,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:13,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-27 11:27:13,227 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2022-04-27 11:27:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:13,227 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-27 11:27:13,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 11:27:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:27:13,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:13,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:13,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:27:13,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash -185588926, now seen corresponding path program 1 times [2022-04-27 11:27:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:13,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147856211] [2022-04-27 11:27:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:13,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:13,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#(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(12, 2);call #Ultimate.allocInit(12, 3); {477#true} is VALID [2022-04-27 11:27:13,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 11:27:13,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #63#return; {477#true} is VALID [2022-04-27 11:27:13,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:13,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#(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(12, 2);call #Ultimate.allocInit(12, 3); {477#true} is VALID [2022-04-27 11:27:13,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} assume true; {477#true} is VALID [2022-04-27 11:27:13,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} #63#return; {477#true} is VALID [2022-04-27 11:27:13,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} call #t~ret7 := main(); {477#true} is VALID [2022-04-27 11:27:13,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {477#true} is VALID [2022-04-27 11:27:13,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {477#true} is VALID [2022-04-27 11:27:13,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {482#(= main_~z~0 0)} is VALID [2022-04-27 11:27:13,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#(= main_~z~0 0)} assume !(~z~0 % 4294967296 < 268435455); {478#false} is VALID [2022-04-27 11:27:13,304 INFO L272 TraceCheckUtils]: 9: Hoare triple {478#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {478#false} is VALID [2022-04-27 11:27:13,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {478#false} ~cond := #in~cond; {478#false} is VALID [2022-04-27 11:27:13,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {478#false} assume 0 == ~cond; {478#false} is VALID [2022-04-27 11:27:13,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-04-27 11:27:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:13,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:13,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147856211] [2022-04-27 11:27:13,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147856211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:27:13,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:27:13,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:27:13,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155774596] [2022-04-27 11:27:13,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:27:13,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-27 11:27:13,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:13,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-27 11:27:13,316 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-27 11:27:13,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:27:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:13,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:27:13,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:27:13,317 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-27 11:27:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:13,396 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-27 11:27:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:27:13,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-27 11:27:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-27 11:27:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 11:27:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-27 11:27:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-27 11:27:13,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-27 11:27:13,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:13,438 INFO L225 Difference]: With dead ends: 39 [2022-04-27 11:27:13,438 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 11:27:13,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-27 11:27:13,439 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:13,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:27:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 11:27:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-27 11:27:13,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:13,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:13,443 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:13,444 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:13,445 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 11:27:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 11:27:13,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:13,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:13,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-27 11:27:13,446 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-27 11:27:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:13,448 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 11:27:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 11:27:13,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:13,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:13,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:13,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-27 11:27:13,450 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-04-27 11:27:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:13,450 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-27 11:27:13,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-27 11:27:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 11:27:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:27:13,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:13,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:13,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 11:27:13,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1431986846, now seen corresponding path program 1 times [2022-04-27 11:27:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:13,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564319807] [2022-04-27 11:27:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:13,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:13,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {643#(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(12, 2);call #Ultimate.allocInit(12, 3); {636#true} is VALID [2022-04-27 11:27:13,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 11:27:13,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {636#true} {636#true} #63#return; {636#true} is VALID [2022-04-27 11:27:13,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:13,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {643#(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(12, 2);call #Ultimate.allocInit(12, 3); {636#true} is VALID [2022-04-27 11:27:13,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 11:27:13,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #63#return; {636#true} is VALID [2022-04-27 11:27:13,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret7 := main(); {636#true} is VALID [2022-04-27 11:27:13,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {636#true} is VALID [2022-04-27 11:27:13,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {636#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {636#true} is VALID [2022-04-27 11:27:13,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {641#(= main_~z~0 0)} is VALID [2022-04-27 11:27:13,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {642#(and (<= main_~z~0 1) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:27:13,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {642#(and (<= main_~z~0 1) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {637#false} is VALID [2022-04-27 11:27:13,527 INFO L272 TraceCheckUtils]: 10: Hoare triple {637#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {637#false} is VALID [2022-04-27 11:27:13,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#false} ~cond := #in~cond; {637#false} is VALID [2022-04-27 11:27:13,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#false} assume 0 == ~cond; {637#false} is VALID [2022-04-27 11:27:13,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 11:27:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:13,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:13,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564319807] [2022-04-27 11:27:13,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564319807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:27:13,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264440352] [2022-04-27 11:27:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:13,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:13,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:13,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:27:13,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:27:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:13,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 11:27:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:13,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:27:13,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2022-04-27 11:27:13,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#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(12, 2);call #Ultimate.allocInit(12, 3); {636#true} is VALID [2022-04-27 11:27:13,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 11:27:13,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #63#return; {636#true} is VALID [2022-04-27 11:27:13,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret7 := main(); {636#true} is VALID [2022-04-27 11:27:13,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {636#true} is VALID [2022-04-27 11:27:13,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {636#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {636#true} is VALID [2022-04-27 11:27:13,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {641#(= main_~z~0 0)} is VALID [2022-04-27 11:27:13,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {671#(= main_~z~0 1)} is VALID [2022-04-27 11:27:13,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {671#(= main_~z~0 1)} assume !(~z~0 % 4294967296 < 268435455); {637#false} is VALID [2022-04-27 11:27:13,727 INFO L272 TraceCheckUtils]: 10: Hoare triple {637#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {637#false} is VALID [2022-04-27 11:27:13,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#false} ~cond := #in~cond; {637#false} is VALID [2022-04-27 11:27:13,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#false} assume 0 == ~cond; {637#false} is VALID [2022-04-27 11:27:13,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 11:27:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:13,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:27:13,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 11:27:13,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#false} assume 0 == ~cond; {637#false} is VALID [2022-04-27 11:27:13,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#false} ~cond := #in~cond; {637#false} is VALID [2022-04-27 11:27:13,837 INFO L272 TraceCheckUtils]: 10: Hoare triple {637#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {637#false} is VALID [2022-04-27 11:27:13,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {699#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {637#false} is VALID [2022-04-27 11:27:13,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {703#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {699#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-27 11:27:13,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {703#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:13,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {636#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {636#true} is VALID [2022-04-27 11:27:13,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {636#true} is VALID [2022-04-27 11:27:13,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret7 := main(); {636#true} is VALID [2022-04-27 11:27:13,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #63#return; {636#true} is VALID [2022-04-27 11:27:13,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 11:27:13,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#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(12, 2);call #Ultimate.allocInit(12, 3); {636#true} is VALID [2022-04-27 11:27:13,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2022-04-27 11:27:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:13,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264440352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:27:13,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:27:13,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 11:27:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526449258] [2022-04-27 11:27:13,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:27:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:27:13,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:13,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:13,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:13,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:27:13,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:13,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:27:13,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:27:13,862 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:14,081 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 11:27:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:27:14,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:27:14,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-27 11:27:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-27 11:27:14,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-04-27 11:27:14,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:14,135 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:27:14,135 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 11:27:14,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:27:14,136 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:14,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 33 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:27:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 11:27:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 11:27:14,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:14,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:14,144 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:14,144 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:14,145 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 11:27:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 11:27:14,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:14,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:14,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 11:27:14,146 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 11:27:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:14,148 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 11:27:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 11:27:14,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:14,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:14,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:14,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-27 11:27:14,150 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2022-04-27 11:27:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:14,150 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-27 11:27:14,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 11:27:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:27:14,151 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:14,151 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:14,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:27:14,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:14,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:14,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1938664258, now seen corresponding path program 2 times [2022-04-27 11:27:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:14,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408247957] [2022-04-27 11:27:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:14,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {916#(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(12, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-27 11:27:14,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-27 11:27:14,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {906#true} {906#true} #63#return; {906#true} is VALID [2022-04-27 11:27:14,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:14,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#(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(12, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-27 11:27:14,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-27 11:27:14,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #63#return; {906#true} is VALID [2022-04-27 11:27:14,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret7 := main(); {906#true} is VALID [2022-04-27 11:27:14,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {906#true} is VALID [2022-04-27 11:27:14,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {906#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {906#true} is VALID [2022-04-27 11:27:14,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {911#(= main_~z~0 0)} is VALID [2022-04-27 11:27:14,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {911#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {912#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:27:14,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {913#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:27:14,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {914#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:27:14,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {914#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {915#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 4))} is VALID [2022-04-27 11:27:14,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {915#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 < 268435455); {907#false} is VALID [2022-04-27 11:27:14,518 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {907#false} is VALID [2022-04-27 11:27:14,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#false} ~cond := #in~cond; {907#false} is VALID [2022-04-27 11:27:14,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#false} assume 0 == ~cond; {907#false} is VALID [2022-04-27 11:27:14,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-27 11:27:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:14,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:14,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408247957] [2022-04-27 11:27:14,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408247957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:27:14,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896967681] [2022-04-27 11:27:14,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:27:14,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:14,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:14,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:27:14,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:27:14,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:27:14,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:27:14,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:27:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:14,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:27:14,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-27 11:27:14,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#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(12, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-27 11:27:14,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-27 11:27:14,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #63#return; {906#true} is VALID [2022-04-27 11:27:14,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret7 := main(); {906#true} is VALID [2022-04-27 11:27:14,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {906#true} is VALID [2022-04-27 11:27:14,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {906#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {906#true} is VALID [2022-04-27 11:27:14,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {911#(= main_~z~0 0)} is VALID [2022-04-27 11:27:14,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {911#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {912#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:27:14,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {913#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:27:14,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {914#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:27:14,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {914#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {953#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:27:14,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {953#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 < 268435455); {907#false} is VALID [2022-04-27 11:27:14,865 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {907#false} is VALID [2022-04-27 11:27:14,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#false} ~cond := #in~cond; {907#false} is VALID [2022-04-27 11:27:14,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#false} assume 0 == ~cond; {907#false} is VALID [2022-04-27 11:27:14,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-27 11:27:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:14,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:27:14,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-27 11:27:14,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#false} assume 0 == ~cond; {907#false} is VALID [2022-04-27 11:27:14,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#false} ~cond := #in~cond; {907#false} is VALID [2022-04-27 11:27:14,998 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {907#false} is VALID [2022-04-27 11:27:14,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {907#false} is VALID [2022-04-27 11:27:15,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {985#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {981#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-27 11:27:15,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {989#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {985#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:15,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {993#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {989#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:27:15,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {997#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {993#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:27:15,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {997#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:27:15,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {906#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {906#true} is VALID [2022-04-27 11:27:15,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {906#true} is VALID [2022-04-27 11:27:15,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret7 := main(); {906#true} is VALID [2022-04-27 11:27:15,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #63#return; {906#true} is VALID [2022-04-27 11:27:15,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-27 11:27:15,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#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(12, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-27 11:27:15,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-27 11:27:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:15,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896967681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:27:15,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:27:15,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 11:27:15,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905960078] [2022-04-27 11:27:15,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:27:15,008 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:27:15,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:15,010 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), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:15,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:15,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:27:15,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:15,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:27:15,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:27:15,032 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:15,822 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 11:27:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:27:15,823 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:27:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 11:27:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-27 11:27:15,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-27 11:27:15,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:15,886 INFO L225 Difference]: With dead ends: 52 [2022-04-27 11:27:15,886 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:27:15,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:27:15,887 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:15,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 53 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:27:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:27:15,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 11:27:15,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:15,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:15,907 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:15,907 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:15,909 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 11:27:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 11:27:15,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:15,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:15,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-27 11:27:15,909 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-27 11:27:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:15,911 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 11:27:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 11:27:15,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:15,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:15,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:15,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 11:27:15,913 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 17 [2022-04-27 11:27:15,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:15,913 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 11:27:15,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 11:27:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:27:15,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:15,914 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:15,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:27:16,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 11:27:16,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1655539902, now seen corresponding path program 3 times [2022-04-27 11:27:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:16,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267840158] [2022-04-27 11:27:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:16,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {1270#(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(12, 2);call #Ultimate.allocInit(12, 3); {1254#true} is VALID [2022-04-27 11:27:16,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#true} assume true; {1254#true} is VALID [2022-04-27 11:27:16,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1254#true} {1254#true} #63#return; {1254#true} is VALID [2022-04-27 11:27:16,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:16,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#(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(12, 2);call #Ultimate.allocInit(12, 3); {1254#true} is VALID [2022-04-27 11:27:16,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} assume true; {1254#true} is VALID [2022-04-27 11:27:16,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} #63#return; {1254#true} is VALID [2022-04-27 11:27:16,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} call #t~ret7 := main(); {1254#true} is VALID [2022-04-27 11:27:16,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1254#true} is VALID [2022-04-27 11:27:16,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {1254#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1254#true} is VALID [2022-04-27 11:27:16,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1254#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1259#(= main_~z~0 0)} is VALID [2022-04-27 11:27:16,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {1259#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1260#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:27:16,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1261#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:27:16,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {1261#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1262#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:27:16,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1263#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:27:16,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {1263#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1264#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:27:16,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1265#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:27:16,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {1265#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1266#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:27:16,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {1266#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1267#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:27:16,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {1267#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1268#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:27:16,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {1268#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1269#(and (<= main_~z~0 10) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:27:16,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {1269#(and (<= main_~z~0 10) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {1255#false} is VALID [2022-04-27 11:27:16,406 INFO L272 TraceCheckUtils]: 19: Hoare triple {1255#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1255#false} is VALID [2022-04-27 11:27:16,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {1255#false} ~cond := #in~cond; {1255#false} is VALID [2022-04-27 11:27:16,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {1255#false} assume 0 == ~cond; {1255#false} is VALID [2022-04-27 11:27:16,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2022-04-27 11:27:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:16,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:16,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267840158] [2022-04-27 11:27:16,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267840158] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:27:16,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849486664] [2022-04-27 11:27:16,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:27:16,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:16,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:16,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:27:16,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 11:27:16,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 11:27:16,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:27:16,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:27:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:16,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:27:16,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1254#true} is VALID [2022-04-27 11:27:16,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#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(12, 2);call #Ultimate.allocInit(12, 3); {1254#true} is VALID [2022-04-27 11:27:16,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} assume true; {1254#true} is VALID [2022-04-27 11:27:16,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} #63#return; {1254#true} is VALID [2022-04-27 11:27:16,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} call #t~ret7 := main(); {1254#true} is VALID [2022-04-27 11:27:16,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1254#true} is VALID [2022-04-27 11:27:16,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {1254#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1254#true} is VALID [2022-04-27 11:27:16,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {1254#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1259#(= main_~z~0 0)} is VALID [2022-04-27 11:27:16,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {1259#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1260#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:27:16,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1261#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:27:16,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {1261#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1262#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:27:16,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1263#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:27:16,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1263#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1264#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:27:16,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1265#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:27:16,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {1265#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1266#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:27:16,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {1266#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1267#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:27:16,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {1267#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1268#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:27:16,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {1268#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1325#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:27:16,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {1325#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 < 268435455); {1255#false} is VALID [2022-04-27 11:27:16,810 INFO L272 TraceCheckUtils]: 19: Hoare triple {1255#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1255#false} is VALID [2022-04-27 11:27:16,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {1255#false} ~cond := #in~cond; {1255#false} is VALID [2022-04-27 11:27:16,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {1255#false} assume 0 == ~cond; {1255#false} is VALID [2022-04-27 11:27:16,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2022-04-27 11:27:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:16,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:27:17,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2022-04-27 11:27:17,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {1255#false} assume 0 == ~cond; {1255#false} is VALID [2022-04-27 11:27:17,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {1255#false} ~cond := #in~cond; {1255#false} is VALID [2022-04-27 11:27:17,143 INFO L272 TraceCheckUtils]: 19: Hoare triple {1255#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1255#false} is VALID [2022-04-27 11:27:17,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {1353#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {1255#false} is VALID [2022-04-27 11:27:17,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {1357#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1353#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {1361#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1357#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {1365#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1361#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {1369#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1365#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {1373#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1369#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {1377#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1373#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {1381#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1377#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1381#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1385#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {1393#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1389#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {1254#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1393#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-27 11:27:17,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {1254#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1254#true} is VALID [2022-04-27 11:27:17,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1254#true} is VALID [2022-04-27 11:27:17,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} call #t~ret7 := main(); {1254#true} is VALID [2022-04-27 11:27:17,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} #63#return; {1254#true} is VALID [2022-04-27 11:27:17,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} assume true; {1254#true} is VALID [2022-04-27 11:27:17,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#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(12, 2);call #Ultimate.allocInit(12, 3); {1254#true} is VALID [2022-04-27 11:27:17,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} call ULTIMATE.init(); {1254#true} is VALID [2022-04-27 11:27:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:17,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849486664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:27:17,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:27:17,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 11:27:17,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408432995] [2022-04-27 11:27:17,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:27:17,153 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:27:17,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:17,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:17,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:17,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 11:27:17,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:17,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 11:27:17,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:27:17,184 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:22,608 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2022-04-27 11:27:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 11:27:22,609 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:27:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 78 transitions. [2022-04-27 11:27:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 78 transitions. [2022-04-27 11:27:22,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 78 transitions. [2022-04-27 11:27:22,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:22,734 INFO L225 Difference]: With dead ends: 70 [2022-04-27 11:27:22,734 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 11:27:22,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=643, Invalid=1613, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 11:27:22,736 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:22,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 88 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:27:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 11:27:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-04-27 11:27:22,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:22,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:22,780 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:22,780 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:22,782 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-27 11:27:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-27 11:27:22,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:22,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:22,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-27 11:27:22,783 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-27 11:27:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:22,785 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-27 11:27:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-27 11:27:22,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:22,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:22,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:22,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:27:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-27 11:27:22,788 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 23 [2022-04-27 11:27:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:22,789 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-27 11:27:22,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-27 11:27:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:27:22,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:22,790 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:22,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 11:27:22,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:22,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:22,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash -398389438, now seen corresponding path program 4 times [2022-04-27 11:27:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:22,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761456054] [2022-04-27 11:27:22,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:23,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:23,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {1786#(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(12, 2);call #Ultimate.allocInit(12, 3); {1758#true} is VALID [2022-04-27 11:27:23,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1758#true} assume true; {1758#true} is VALID [2022-04-27 11:27:23,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1758#true} {1758#true} #63#return; {1758#true} is VALID [2022-04-27 11:27:23,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {1758#true} call ULTIMATE.init(); {1786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:23,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {1786#(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(12, 2);call #Ultimate.allocInit(12, 3); {1758#true} is VALID [2022-04-27 11:27:23,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {1758#true} assume true; {1758#true} is VALID [2022-04-27 11:27:23,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1758#true} {1758#true} #63#return; {1758#true} is VALID [2022-04-27 11:27:23,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {1758#true} call #t~ret7 := main(); {1758#true} is VALID [2022-04-27 11:27:23,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {1758#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1758#true} is VALID [2022-04-27 11:27:23,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {1758#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1758#true} is VALID [2022-04-27 11:27:23,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {1758#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1763#(= main_~z~0 0)} is VALID [2022-04-27 11:27:23,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {1763#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1764#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:27:23,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {1764#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1765#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:27:23,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {1765#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1766#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:27:23,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {1766#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:27:23,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {1767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1768#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:27:23,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {1768#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1769#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:27:23,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {1769#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1770#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:27:23,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {1770#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1771#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:27:23,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {1771#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1772#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:27:23,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {1772#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1773#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:27:23,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {1773#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1774#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:27:23,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {1774#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1775#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:27:23,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1776#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:27:23,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1777#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:27:23,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {1777#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1778#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:27:23,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {1778#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1779#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-27 11:27:23,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {1779#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1780#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-27 11:27:23,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {1780#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1781#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-27 11:27:23,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {1781#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1782#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-27 11:27:23,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {1782#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1783#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-27 11:27:23,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {1783#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1784#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-27 11:27:23,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {1784#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1785#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 22))} is VALID [2022-04-27 11:27:23,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {1785#(and (not (<= (+ (div main_~z~0 4294967296) 1) 0)) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 < 268435455); {1759#false} is VALID [2022-04-27 11:27:23,581 INFO L272 TraceCheckUtils]: 31: Hoare triple {1759#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1759#false} is VALID [2022-04-27 11:27:23,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {1759#false} ~cond := #in~cond; {1759#false} is VALID [2022-04-27 11:27:23,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {1759#false} assume 0 == ~cond; {1759#false} is VALID [2022-04-27 11:27:23,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2022-04-27 11:27:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:23,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:23,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761456054] [2022-04-27 11:27:23,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761456054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:27:23,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818956794] [2022-04-27 11:27:23,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:27:23,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:23,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:23,588 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:27:23,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 11:27:23,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:27:23,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:27:23,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 11:27:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:23,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:27:24,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {1758#true} call ULTIMATE.init(); {1758#true} is VALID [2022-04-27 11:27:24,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {1758#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(12, 2);call #Ultimate.allocInit(12, 3); {1758#true} is VALID [2022-04-27 11:27:24,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {1758#true} assume true; {1758#true} is VALID [2022-04-27 11:27:24,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1758#true} {1758#true} #63#return; {1758#true} is VALID [2022-04-27 11:27:24,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {1758#true} call #t~ret7 := main(); {1758#true} is VALID [2022-04-27 11:27:24,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {1758#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1758#true} is VALID [2022-04-27 11:27:24,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {1758#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1758#true} is VALID [2022-04-27 11:27:24,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {1758#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1763#(= main_~z~0 0)} is VALID [2022-04-27 11:27:24,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1763#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1764#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:27:24,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {1764#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1765#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:27:24,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {1765#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1766#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:27:24,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {1766#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:27:24,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {1767#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1768#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:27:24,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {1768#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1769#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:27:24,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {1769#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1770#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:27:24,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {1770#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1771#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:27:24,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {1771#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1772#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:27:24,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {1772#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1773#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:27:24,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {1773#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1774#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:27:24,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {1774#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1775#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:27:24,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1776#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:27:24,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1777#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:27:24,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {1777#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1778#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:27:24,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {1778#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1779#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-27 11:27:24,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {1779#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1780#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-27 11:27:24,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {1780#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1781#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-27 11:27:24,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {1781#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1782#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-27 11:27:24,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {1782#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1783#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-27 11:27:24,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {1783#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1784#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-27 11:27:24,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {1784#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1877#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-27 11:27:24,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {1877#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 < 268435455); {1759#false} is VALID [2022-04-27 11:27:24,183 INFO L272 TraceCheckUtils]: 31: Hoare triple {1759#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1759#false} is VALID [2022-04-27 11:27:24,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {1759#false} ~cond := #in~cond; {1759#false} is VALID [2022-04-27 11:27:24,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {1759#false} assume 0 == ~cond; {1759#false} is VALID [2022-04-27 11:27:24,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2022-04-27 11:27:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:24,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:27:25,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2022-04-27 11:27:25,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {1759#false} assume 0 == ~cond; {1759#false} is VALID [2022-04-27 11:27:25,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {1759#false} ~cond := #in~cond; {1759#false} is VALID [2022-04-27 11:27:25,304 INFO L272 TraceCheckUtils]: 31: Hoare triple {1759#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1759#false} is VALID [2022-04-27 11:27:25,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {1905#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {1759#false} is VALID [2022-04-27 11:27:25,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {1909#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1905#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {1913#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1909#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {1917#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1913#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {1921#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1917#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1921#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {1929#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1925#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {1933#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1929#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {1937#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1933#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {1941#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1937#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {1945#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1941#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {1949#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1945#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {1953#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1949#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {1957#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1953#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {1961#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1957#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {1965#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1961#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {1969#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1965#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {1973#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1969#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {1977#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1973#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {1981#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1977#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {1985#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1981#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {1989#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1985#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {1993#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1989#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {1758#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {1993#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-27 11:27:25,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {1758#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {1758#true} is VALID [2022-04-27 11:27:25,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {1758#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {1758#true} is VALID [2022-04-27 11:27:25,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {1758#true} call #t~ret7 := main(); {1758#true} is VALID [2022-04-27 11:27:25,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1758#true} {1758#true} #63#return; {1758#true} is VALID [2022-04-27 11:27:25,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {1758#true} assume true; {1758#true} is VALID [2022-04-27 11:27:25,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1758#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(12, 2);call #Ultimate.allocInit(12, 3); {1758#true} is VALID [2022-04-27 11:27:25,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {1758#true} call ULTIMATE.init(); {1758#true} is VALID [2022-04-27 11:27:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:25,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818956794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:27:25,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:27:25,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 11:27:25,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892665856] [2022-04-27 11:27:25,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:27:25,326 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:27:25,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:25,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:25,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:25,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 11:27:25,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 11:27:25,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 11:27:25,395 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:20,003 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2022-04-27 11:29:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-27 11:29:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:29:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:29:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 114 transitions. [2022-04-27 11:29:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 114 transitions. [2022-04-27 11:29:20,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 114 transitions. [2022-04-27 11:29:20,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:20,300 INFO L225 Difference]: With dead ends: 106 [2022-04-27 11:29:20,300 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 11:29:20,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 113.7s TimeCoverageRelationStatistics Valid=2439, Invalid=6677, Unknown=4, NotChecked=0, Total=9120 [2022-04-27 11:29:20,303 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:29:20,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 153 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 11:29:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 11:29:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 11:29:20,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:29:20,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:29:20,373 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:29:20,373 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:29:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:20,375 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 11:29:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 11:29:20,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:20,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:20,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 69 states. [2022-04-27 11:29:20,377 INFO L87 Difference]: Start difference. First operand has 68 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 69 states. [2022-04-27 11:29:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:20,378 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 11:29:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 11:29:20,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:20,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:20,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:29:20,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:29:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:29:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-27 11:29:20,381 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 35 [2022-04-27 11:29:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:29:20,381 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-27 11:29:20,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-27 11:29:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 11:29:20,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:29:20,382 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:29:20,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 11:29:20,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:29:20,595 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:29:20,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:29:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1733148862, now seen corresponding path program 5 times [2022-04-27 11:29:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:29:20,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962105981] [2022-04-27 11:29:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:29:20,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:29:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:22,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:29:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:22,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {2626#(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(12, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-27 11:29:22,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-27 11:29:22,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2574#true} {2574#true} #63#return; {2574#true} is VALID [2022-04-27 11:29:22,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {2574#true} call ULTIMATE.init(); {2626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:29:22,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {2626#(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(12, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-27 11:29:22,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-27 11:29:22,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#true} {2574#true} #63#return; {2574#true} is VALID [2022-04-27 11:29:22,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#true} call #t~ret7 := main(); {2574#true} is VALID [2022-04-27 11:29:22,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2574#true} is VALID [2022-04-27 11:29:22,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2574#true} is VALID [2022-04-27 11:29:22,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2579#(= main_~z~0 0)} is VALID [2022-04-27 11:29:22,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {2579#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2580#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:29:22,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {2580#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2581#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:29:22,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {2581#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2582#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:29:22,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {2582#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2583#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:29:22,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {2583#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:29:22,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {2584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2585#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:29:22,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {2585#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2586#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:29:22,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {2586#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2587#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:29:22,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {2587#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2588#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:29:22,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {2588#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2589#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:29:22,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {2589#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2590#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:29:22,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2591#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:29:22,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {2591#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2592#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:29:22,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {2592#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2593#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:29:22,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {2593#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2594#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:29:22,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {2594#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2595#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-27 11:29:22,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {2595#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2596#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-27 11:29:22,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {2596#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2597#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-27 11:29:22,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {2597#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2598#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-27 11:29:22,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {2598#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2599#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-27 11:29:22,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {2599#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2600#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-27 11:29:22,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {2600#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2601#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-27 11:29:22,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {2601#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2602#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-27 11:29:22,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {2602#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2603#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-27 11:29:22,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {2603#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2604#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-27 11:29:22,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {2604#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2605#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-27 11:29:22,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {2605#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2606#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-27 11:29:22,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {2606#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2607#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-27 11:29:22,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {2607#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2608#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-27 11:29:22,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {2608#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2609#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-27 11:29:22,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {2609#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2610#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-27 11:29:22,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {2610#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2611#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-27 11:29:22,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {2611#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2612#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-27 11:29:22,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {2612#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2613#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-27 11:29:22,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {2613#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2614#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-27 11:29:22,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {2614#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2615#(and (<= 36 main_~z~0) (<= main_~z~0 36))} is VALID [2022-04-27 11:29:22,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {2615#(and (<= 36 main_~z~0) (<= main_~z~0 36))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2616#(and (<= 37 main_~z~0) (<= main_~z~0 37))} is VALID [2022-04-27 11:29:22,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {2616#(and (<= 37 main_~z~0) (<= main_~z~0 37))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2617#(and (<= main_~z~0 38) (<= 38 main_~z~0))} is VALID [2022-04-27 11:29:22,094 INFO L290 TraceCheckUtils]: 46: Hoare triple {2617#(and (<= main_~z~0 38) (<= 38 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2618#(and (<= main_~z~0 39) (<= 39 main_~z~0))} is VALID [2022-04-27 11:29:22,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {2618#(and (<= main_~z~0 39) (<= 39 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2619#(and (<= main_~z~0 40) (<= 40 main_~z~0))} is VALID [2022-04-27 11:29:22,095 INFO L290 TraceCheckUtils]: 48: Hoare triple {2619#(and (<= main_~z~0 40) (<= 40 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2620#(and (<= main_~z~0 41) (<= 41 main_~z~0))} is VALID [2022-04-27 11:29:22,096 INFO L290 TraceCheckUtils]: 49: Hoare triple {2620#(and (<= main_~z~0 41) (<= 41 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2621#(and (<= 42 main_~z~0) (<= main_~z~0 42))} is VALID [2022-04-27 11:29:22,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {2621#(and (<= 42 main_~z~0) (<= main_~z~0 42))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2622#(and (<= main_~z~0 43) (<= 43 main_~z~0))} is VALID [2022-04-27 11:29:22,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {2622#(and (<= main_~z~0 43) (<= 43 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2623#(and (<= main_~z~0 44) (<= 44 main_~z~0))} is VALID [2022-04-27 11:29:22,098 INFO L290 TraceCheckUtils]: 52: Hoare triple {2623#(and (<= main_~z~0 44) (<= 44 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2624#(and (<= main_~z~0 45) (<= 45 main_~z~0))} is VALID [2022-04-27 11:29:22,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {2624#(and (<= main_~z~0 45) (<= 45 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2625#(and (<= main_~z~0 46) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:29:22,099 INFO L290 TraceCheckUtils]: 54: Hoare triple {2625#(and (<= main_~z~0 46) (not (<= (+ (div main_~z~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 < 268435455); {2575#false} is VALID [2022-04-27 11:29:22,099 INFO L272 TraceCheckUtils]: 55: Hoare triple {2575#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {2575#false} is VALID [2022-04-27 11:29:22,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {2575#false} ~cond := #in~cond; {2575#false} is VALID [2022-04-27 11:29:22,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {2575#false} assume 0 == ~cond; {2575#false} is VALID [2022-04-27 11:29:22,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {2575#false} assume !false; {2575#false} is VALID [2022-04-27 11:29:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:29:22,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:29:22,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962105981] [2022-04-27 11:29:22,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962105981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:29:22,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697384175] [2022-04-27 11:29:22,101 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:29:22,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:29:22,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:29:22,104 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:29:22,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 11:29:52,355 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-27 11:29:52,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:29:52,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-27 11:29:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:52,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:29:53,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {2574#true} call ULTIMATE.init(); {2574#true} is VALID [2022-04-27 11:29:53,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#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(12, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-27 11:29:53,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-27 11:29:53,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#true} {2574#true} #63#return; {2574#true} is VALID [2022-04-27 11:29:53,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#true} call #t~ret7 := main(); {2574#true} is VALID [2022-04-27 11:29:53,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2574#true} is VALID [2022-04-27 11:29:53,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2574#true} is VALID [2022-04-27 11:29:53,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {2579#(= main_~z~0 0)} is VALID [2022-04-27 11:29:53,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {2579#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2580#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:29:53,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {2580#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2581#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:29:53,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {2581#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2582#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:29:53,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {2582#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2583#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:29:53,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {2583#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:29:53,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {2584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2585#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:29:53,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {2585#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2586#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:29:53,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {2586#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2587#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:29:53,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {2587#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2588#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:29:53,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {2588#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2589#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:29:53,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {2589#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2590#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:29:53,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2591#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:29:53,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {2591#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2592#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:29:53,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {2592#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2593#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:29:53,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {2593#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2594#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:29:53,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {2594#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2595#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-27 11:29:53,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {2595#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2596#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-27 11:29:53,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {2596#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2597#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-27 11:29:53,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {2597#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2598#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-27 11:29:53,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {2598#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2599#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-27 11:29:53,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {2599#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2600#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-27 11:29:53,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {2600#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2601#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-27 11:29:53,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {2601#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2602#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-27 11:29:53,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {2602#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2603#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-27 11:29:53,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {2603#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2604#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-27 11:29:53,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {2604#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2605#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-27 11:29:53,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {2605#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2606#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-27 11:29:53,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {2606#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2607#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-27 11:29:53,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {2607#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2608#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-27 11:29:53,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {2608#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2609#(and (<= 30 main_~z~0) (<= main_~z~0 30))} is VALID [2022-04-27 11:29:53,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {2609#(and (<= 30 main_~z~0) (<= main_~z~0 30))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2610#(and (<= 31 main_~z~0) (<= main_~z~0 31))} is VALID [2022-04-27 11:29:53,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {2610#(and (<= 31 main_~z~0) (<= main_~z~0 31))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2611#(and (<= 32 main_~z~0) (<= main_~z~0 32))} is VALID [2022-04-27 11:29:53,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {2611#(and (<= 32 main_~z~0) (<= main_~z~0 32))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2612#(and (<= 33 main_~z~0) (<= main_~z~0 33))} is VALID [2022-04-27 11:29:53,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {2612#(and (<= 33 main_~z~0) (<= main_~z~0 33))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2613#(and (<= main_~z~0 34) (<= 34 main_~z~0))} is VALID [2022-04-27 11:29:53,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {2613#(and (<= main_~z~0 34) (<= 34 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2614#(and (<= main_~z~0 35) (<= 35 main_~z~0))} is VALID [2022-04-27 11:29:53,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {2614#(and (<= main_~z~0 35) (<= 35 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2615#(and (<= 36 main_~z~0) (<= main_~z~0 36))} is VALID [2022-04-27 11:29:53,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {2615#(and (<= 36 main_~z~0) (<= main_~z~0 36))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2616#(and (<= 37 main_~z~0) (<= main_~z~0 37))} is VALID [2022-04-27 11:29:53,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {2616#(and (<= 37 main_~z~0) (<= main_~z~0 37))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2617#(and (<= main_~z~0 38) (<= 38 main_~z~0))} is VALID [2022-04-27 11:29:53,146 INFO L290 TraceCheckUtils]: 46: Hoare triple {2617#(and (<= main_~z~0 38) (<= 38 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2618#(and (<= main_~z~0 39) (<= 39 main_~z~0))} is VALID [2022-04-27 11:29:53,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {2618#(and (<= main_~z~0 39) (<= 39 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2619#(and (<= main_~z~0 40) (<= 40 main_~z~0))} is VALID [2022-04-27 11:29:53,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {2619#(and (<= main_~z~0 40) (<= 40 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2620#(and (<= main_~z~0 41) (<= 41 main_~z~0))} is VALID [2022-04-27 11:29:53,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {2620#(and (<= main_~z~0 41) (<= 41 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2621#(and (<= 42 main_~z~0) (<= main_~z~0 42))} is VALID [2022-04-27 11:29:53,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {2621#(and (<= 42 main_~z~0) (<= main_~z~0 42))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2622#(and (<= main_~z~0 43) (<= 43 main_~z~0))} is VALID [2022-04-27 11:29:53,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {2622#(and (<= main_~z~0 43) (<= 43 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2623#(and (<= main_~z~0 44) (<= 44 main_~z~0))} is VALID [2022-04-27 11:29:53,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {2623#(and (<= main_~z~0 44) (<= 44 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2624#(and (<= main_~z~0 45) (<= 45 main_~z~0))} is VALID [2022-04-27 11:29:53,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {2624#(and (<= main_~z~0 45) (<= 45 main_~z~0))} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2789#(and (<= 46 main_~z~0) (<= main_~z~0 46))} is VALID [2022-04-27 11:29:53,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {2789#(and (<= 46 main_~z~0) (<= main_~z~0 46))} assume !(~z~0 % 4294967296 < 268435455); {2575#false} is VALID [2022-04-27 11:29:53,150 INFO L272 TraceCheckUtils]: 55: Hoare triple {2575#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {2575#false} is VALID [2022-04-27 11:29:53,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {2575#false} ~cond := #in~cond; {2575#false} is VALID [2022-04-27 11:29:53,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {2575#false} assume 0 == ~cond; {2575#false} is VALID [2022-04-27 11:29:53,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {2575#false} assume !false; {2575#false} is VALID [2022-04-27 11:29:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:29:53,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:29:56,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {2575#false} assume !false; {2575#false} is VALID [2022-04-27 11:29:56,827 INFO L290 TraceCheckUtils]: 57: Hoare triple {2575#false} assume 0 == ~cond; {2575#false} is VALID [2022-04-27 11:29:56,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {2575#false} ~cond := #in~cond; {2575#false} is VALID [2022-04-27 11:29:56,828 INFO L272 TraceCheckUtils]: 55: Hoare triple {2575#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 4 then ~z~0 % 4294967296 % 4 - 4 else ~z~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {2575#false} is VALID [2022-04-27 11:29:56,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {2817#(< (mod main_~z~0 4294967296) 268435455)} assume !(~z~0 % 4294967296 < 268435455); {2575#false} is VALID [2022-04-27 11:29:56,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {2821#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2817#(< (mod main_~z~0 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,829 INFO L290 TraceCheckUtils]: 52: Hoare triple {2825#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2821#(< (mod (+ main_~z~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {2829#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2825#(< (mod (+ main_~z~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {2833#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2829#(< (mod (+ main_~z~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {2837#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2833#(< (mod (+ main_~z~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {2841#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2837#(< (mod (+ 5 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {2845#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2841#(< (mod (+ main_~z~0 6) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {2849#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2845#(< (mod (+ 7 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {2853#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2849#(< (mod (+ main_~z~0 8) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,834 INFO L290 TraceCheckUtils]: 44: Hoare triple {2857#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2853#(< (mod (+ main_~z~0 9) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {2861#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2857#(< (mod (+ main_~z~0 10) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {2865#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2861#(< (mod (+ main_~z~0 11) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {2869#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2865#(< (mod (+ main_~z~0 12) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {2873#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2869#(< (mod (+ main_~z~0 13) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {2877#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2873#(< (mod (+ main_~z~0 14) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {2881#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2877#(< (mod (+ main_~z~0 15) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {2885#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2881#(< (mod (+ main_~z~0 16) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {2889#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2885#(< (mod (+ main_~z~0 17) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {2893#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2889#(< (mod (+ main_~z~0 18) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {2897#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2893#(< (mod (+ 19 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {2901#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2897#(< (mod (+ main_~z~0 20) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {2905#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2901#(< (mod (+ main_~z~0 21) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {2909#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2905#(< (mod (+ main_~z~0 22) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {2913#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2909#(< (mod (+ 23 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {2917#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2913#(< (mod (+ main_~z~0 24) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {2921#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2917#(< (mod (+ main_~z~0 25) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {2925#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2921#(< (mod (+ main_~z~0 26) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {2929#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2925#(< (mod (+ main_~z~0 27) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {2933#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2929#(< (mod (+ main_~z~0 28) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {2937#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2933#(< (mod (+ 29 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {2941#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2937#(< (mod (+ 30 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {2945#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2941#(< (mod (+ main_~z~0 31) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {2949#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2945#(< (mod (+ 32 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {2953#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2949#(< (mod (+ main_~z~0 33) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {2957#(< (mod (+ 35 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2953#(< (mod (+ main_~z~0 34) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {2961#(< (mod (+ main_~z~0 36) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2957#(< (mod (+ 35 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {2965#(< (mod (+ main_~z~0 37) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2961#(< (mod (+ main_~z~0 36) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {2969#(< (mod (+ main_~z~0 38) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2965#(< (mod (+ main_~z~0 37) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {2973#(< (mod (+ main_~z~0 39) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2969#(< (mod (+ main_~z~0 38) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {2977#(< (mod (+ 40 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2973#(< (mod (+ main_~z~0 39) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {2981#(< (mod (+ 41 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2977#(< (mod (+ 40 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {2985#(< (mod (+ 42 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2981#(< (mod (+ 41 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {2989#(< (mod (+ main_~z~0 43) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2985#(< (mod (+ 42 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {2993#(< (mod (+ 44 main_~z~0) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2989#(< (mod (+ main_~z~0 43) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {2997#(< (mod (+ main_~z~0 45) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2993#(< (mod (+ 44 main_~z~0) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {3001#(< (mod (+ main_~z~0 46) 4294967296) 268435455)} assume !!(~z~0 % 4294967296 < 268435455);#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2997#(< (mod (+ main_~z~0 45) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#true} assume !!(~y~0 % 4294967296 < 268435455);~z~0 := 0; {3001#(< (mod (+ main_~z~0 46) 4294967296) 268435455)} is VALID [2022-04-27 11:29:56,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#true} assume !!(~x~0 % 4294967296 < 268435455);~y~0 := 0; {2574#true} is VALID [2022-04-27 11:29:56,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0; {2574#true} is VALID [2022-04-27 11:29:56,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#true} call #t~ret7 := main(); {2574#true} is VALID [2022-04-27 11:29:56,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#true} {2574#true} #63#return; {2574#true} is VALID [2022-04-27 11:29:56,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-27 11:29:56,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#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(12, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-27 11:29:56,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {2574#true} call ULTIMATE.init(); {2574#true} is VALID [2022-04-27 11:29:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:29:56,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697384175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:29:56,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:29:56,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-27 11:29:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526575680] [2022-04-27 11:29:56,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:29:56,861 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-27 11:29:56,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:29:56,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:56,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:56,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-27 11:29:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:29:56,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-27 11:29:56,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-04-27 11:29:56,940 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 98 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:30:56,207 WARN L232 SmtUtils]: Spent 13.63s on a formula simplification. DAG size of input: 196 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:30:58,252 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 11 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 37 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 27) 4294967296) 268435455) (< (mod (+ 13 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 43 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 25 c_main_~z~0) 4294967296) 268435455) (< (mod c_main_~z~0 4294967296) 268435455) (< (mod (+ 2 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 31 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 45 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 24) 4294967296) 268435455) (< (mod (+ 6 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 20 c_main_~z~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 17 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 1) 4294967296) 268435455)) is different from false [2022-04-27 11:31:51,466 WARN L232 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 182 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:32:46,925 WARN L232 SmtUtils]: Spent 15.55s on a formula simplification. DAG size of input: 184 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:33:53,979 WARN L232 SmtUtils]: Spent 8.63s on a formula simplification. DAG size of input: 180 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:34:52,276 WARN L232 SmtUtils]: Spent 10.93s on a formula simplification. DAG size of input: 176 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:35:53,246 WARN L232 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 172 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:35:55,309 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 11 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 37 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 27) 4294967296) 268435455) (< (mod (+ 13 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 25 c_main_~z~0) 4294967296) 268435455) (< (mod c_main_~z~0 4294967296) 268435455) (< (mod (+ 2 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 31 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 24) 4294967296) 268435455) (< (mod (+ 6 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 20 c_main_~z~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 17 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 1) 4294967296) 268435455)) is different from false [2022-04-27 11:37:02,851 WARN L232 SmtUtils]: Spent 13.18s on a formula simplification. DAG size of input: 158 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:38:10,734 WARN L232 SmtUtils]: Spent 13.40s on a formula simplification. DAG size of input: 160 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:39:08,289 WARN L232 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 156 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:40:04,623 WARN L232 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 152 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:40:06,688 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 11 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 27) 4294967296) 268435455) (< (mod (+ 13 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 25 c_main_~z~0) 4294967296) 268435455) (< (mod c_main_~z~0 4294967296) 268435455) (< (mod (+ 2 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 31 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 24) 4294967296) 268435455) (< (mod (+ 6 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 20 c_main_~z~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 17 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 1) 4294967296) 268435455)) is different from false