/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/n.c11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:35:17,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:35:17,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:35:17,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:35:17,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:35:17,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:35:17,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:35:17,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:35:17,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:35:17,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:35:17,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:35:17,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:35:17,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:35:17,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:35:17,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:35:17,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:35:17,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:35:17,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:35:17,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:35:17,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:35:17,162 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:35:17,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:35:17,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:35:17,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:35:17,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:35:17,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:35:17,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:35:17,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:35:17,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:35:17,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:35:17,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:35:17,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:35:17,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:35:17,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:35:17,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:35:17,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:35:17,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:35:17,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:35:17,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:35:17,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:35:17,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:35:17,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:35:17,179 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:35:17,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:35:17,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:35:17,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:35:17,188 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:35:17,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:35:17,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:35:17,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:35:17,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:35:17,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:35:17,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:35:17,189 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:35:17,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:35:17,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:35:17,190 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:35:17,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:35:17,191 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:35:17,191 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:35:17,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:35:17,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:35:17,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:35:17,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:35:17,400 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:35:17,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c11.c [2022-04-08 03:35:17,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d422b4d3a/00dc313946884e81978cb2ee12d43ec8/FLAGfb0b6f76f [2022-04-08 03:35:17,834 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:35:17,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c11.c [2022-04-08 03:35:17,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d422b4d3a/00dc313946884e81978cb2ee12d43ec8/FLAGfb0b6f76f [2022-04-08 03:35:17,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d422b4d3a/00dc313946884e81978cb2ee12d43ec8 [2022-04-08 03:35:17,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:35:17,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:35:17,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:35:17,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:35:17,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:35:17,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:17" (1/1) ... [2022-04-08 03:35:17,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b2afffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:17, skipping insertion in model container [2022-04-08 03:35:17,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:17" (1/1) ... [2022-04-08 03:35:17,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:35:17,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:35:18,021 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/n.c11.c[317,330] [2022-04-08 03:35:18,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:35:18,035 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:35:18,053 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/n.c11.c[317,330] [2022-04-08 03:35:18,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:35:18,067 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:35:18,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18 WrapperNode [2022-04-08 03:35:18,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:35:18,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:35:18,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:35:18,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:35:18,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18" (1/1) ... [2022-04-08 03:35:18,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18" (1/1) ... [2022-04-08 03:35:18,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18" (1/1) ... [2022-04-08 03:35:18,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18" (1/1) ... [2022-04-08 03:35:18,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18" (1/1) ... [2022-04-08 03:35:18,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18" (1/1) ... [2022-04-08 03:35:18,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18" (1/1) ... [2022-04-08 03:35:18,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:35:18,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:35:18,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:35:18,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:35:18,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18" (1/1) ... [2022-04-08 03:35:18,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:35:18,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:18,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 03:35:18,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 03:35:18,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:35:18,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:35:18,192 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:35:18,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:35:18,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:35:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:35:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:35:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:35:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:35:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:35:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-08 03:35:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:35:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:35:18,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:35:18,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:35:18,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:35:18,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:35:18,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:35:18,243 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:35:18,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:35:18,341 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:35:18,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:35:18,346 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:35:18,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:18 BoogieIcfgContainer [2022-04-08 03:35:18,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:35:18,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:35:18,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:35:18,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:35:18,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:35:17" (1/3) ... [2022-04-08 03:35:18,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8a1e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:18, skipping insertion in model container [2022-04-08 03:35:18,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:18" (2/3) ... [2022-04-08 03:35:18,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8a1e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:18, skipping insertion in model container [2022-04-08 03:35:18,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:18" (3/3) ... [2022-04-08 03:35:18,352 INFO L111 eAbstractionObserver]: Analyzing ICFG n.c11.c [2022-04-08 03:35:18,355 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:35:18,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:35:18,381 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:35:18,385 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:35:18,385 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:35:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:35:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:35:18,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:18,400 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:18,400 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash 536722933, now seen corresponding path program 1 times [2022-04-08 03:35:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:18,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1145009214] [2022-04-08 03:35:18,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:35:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash 536722933, now seen corresponding path program 2 times [2022-04-08 03:35:18,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:18,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577580881] [2022-04-08 03:35:18,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:18,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(8, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-08 03:35:18,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 03:35:18,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2022-04-08 03:35:18,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:18,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(8, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-08 03:35:18,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 03:35:18,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2022-04-08 03:35:18,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-08 03:35:18,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {24#true} is VALID [2022-04-08 03:35:18,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-08 03:35:18,530 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {25#false} is VALID [2022-04-08 03:35:18,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-08 03:35:18,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-08 03:35:18,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 03:35:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:18,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:18,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577580881] [2022-04-08 03:35:18,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577580881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:18,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:18,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:35:18,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:18,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1145009214] [2022-04-08 03:35:18,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1145009214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:18,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:18,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:35:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440400121] [2022-04-08 03:35:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:18,538 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-08 03:35:18,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:18,543 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-08 03:35:18,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:18,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:35:18,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:18,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:35:18,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:35:18,579 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 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-08 03:35:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:18,667 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-08 03:35:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:35:18,667 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-08 03:35:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:18,668 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-08 03:35:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-08 03:35:18,673 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-08 03:35:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-08 03:35:18,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-08 03:35:18,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:18,738 INFO L225 Difference]: With dead ends: 33 [2022-04-08 03:35:18,738 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 03:35:18,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:35:18,748 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:18,749 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:35:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 03:35:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 03:35:18,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:18,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:18,777 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:18,777 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:18,782 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 03:35:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 03:35:18,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:18,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:18,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 03:35:18,784 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 03:35:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:18,788 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 03:35:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 03:35:18,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:18,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:18,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:18,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-08 03:35:18,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-08 03:35:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:18,792 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-08 03:35:18,792 INFO L479 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-08 03:35:18,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-08 03:35:18,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 03:35:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:35:18,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:18,817 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:18,818 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:35:18,818 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:18,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:18,821 INFO L85 PathProgramCache]: Analyzing trace with hash 526564202, now seen corresponding path program 1 times [2022-04-08 03:35:18,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:18,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2115142780] [2022-04-08 03:35:18,825 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:35:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash 526564202, now seen corresponding path program 2 times [2022-04-08 03:35:18,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:18,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465817663] [2022-04-08 03:35:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:18,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(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(8, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-08 03:35:18,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-08 03:35:18,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #44#return; {154#true} is VALID [2022-04-08 03:35:18,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:18,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(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(8, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-08 03:35:18,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-08 03:35:18,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #44#return; {154#true} is VALID [2022-04-08 03:35:18,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret6 := main(); {154#true} is VALID [2022-04-08 03:35:18,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {159#(= main_~len~0 0)} is VALID [2022-04-08 03:35:18,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= main_~len~0 0)} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {159#(= main_~len~0 0)} is VALID [2022-04-08 03:35:18,941 INFO L272 TraceCheckUtils]: 7: Hoare triple {159#(= main_~len~0 0)} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {160#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:18,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {161#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:18,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {155#false} is VALID [2022-04-08 03:35:18,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-08 03:35:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:18,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465817663] [2022-04-08 03:35:18,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465817663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:18,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:18,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:18,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:18,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2115142780] [2022-04-08 03:35:18,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2115142780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:18,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:18,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708359953] [2022-04-08 03:35:18,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 03:35:18,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:18,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:18,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:18,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:35:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:35:18,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:35:18,958 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,072 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 03:35:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:35:19,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 03:35:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-08 03:35:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-08 03:35:19,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-08 03:35:19,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:19,105 INFO L225 Difference]: With dead ends: 28 [2022-04-08 03:35:19,106 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 03:35:19,106 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:35:19,109 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:19,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:35:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 03:35:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-08 03:35:19,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:19,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,115 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,115 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,116 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 03:35:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 03:35:19,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:19,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:19,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 03:35:19,117 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 03:35:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,118 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-08 03:35:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-08 03:35:19,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:19,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:19,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:19,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-08 03:35:19,119 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-08 03:35:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:19,119 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-08 03:35:19,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-08 03:35:19,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-08 03:35:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:35:19,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:19,133 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:19,133 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:35:19,133 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:19,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash -234031063, now seen corresponding path program 1 times [2022-04-08 03:35:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:19,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336442507] [2022-04-08 03:35:19,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:19,145 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:19,145 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash -234031063, now seen corresponding path program 2 times [2022-04-08 03:35:19,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:19,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921834276] [2022-04-08 03:35:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:19,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:19,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#(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(8, 2);call #Ultimate.allocInit(12, 3); {293#true} is VALID [2022-04-08 03:35:19,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-08 03:35:19,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {293#true} {293#true} #44#return; {293#true} is VALID [2022-04-08 03:35:19,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:19,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#(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(8, 2);call #Ultimate.allocInit(12, 3); {293#true} is VALID [2022-04-08 03:35:19,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-08 03:35:19,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #44#return; {293#true} is VALID [2022-04-08 03:35:19,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret6 := main(); {293#true} is VALID [2022-04-08 03:35:19,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {298#(= main_~len~0 0)} is VALID [2022-04-08 03:35:19,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {298#(= main_~len~0 0)} is VALID [2022-04-08 03:35:19,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {298#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {298#(= main_~len~0 0)} is VALID [2022-04-08 03:35:19,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {299#(and (<= main_~len~0 1) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:19,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {299#(and (<= main_~len~0 1) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {299#(and (<= main_~len~0 1) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:19,224 INFO L272 TraceCheckUtils]: 10: Hoare triple {299#(and (<= main_~len~0 1) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {300#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:19,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {300#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {301#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:19,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {301#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {294#false} is VALID [2022-04-08 03:35:19,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} assume !false; {294#false} is VALID [2022-04-08 03:35:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:19,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:19,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921834276] [2022-04-08 03:35:19,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921834276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:19,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183548007] [2022-04-08 03:35:19,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:19,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:19,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:19,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:19,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 03:35:19,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:19,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:19,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:35:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:19,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:19,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {293#true} is VALID [2022-04-08 03:35:19,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#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(8, 2);call #Ultimate.allocInit(12, 3); {293#true} is VALID [2022-04-08 03:35:19,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-08 03:35:19,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #44#return; {293#true} is VALID [2022-04-08 03:35:19,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret6 := main(); {293#true} is VALID [2022-04-08 03:35:19,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {298#(= main_~len~0 0)} is VALID [2022-04-08 03:35:19,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {298#(= main_~len~0 0)} is VALID [2022-04-08 03:35:19,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {298#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {298#(= main_~len~0 0)} is VALID [2022-04-08 03:35:19,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {330#(= main_~len~0 1)} is VALID [2022-04-08 03:35:19,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {330#(= main_~len~0 1)} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {330#(= main_~len~0 1)} is VALID [2022-04-08 03:35:19,384 INFO L272 TraceCheckUtils]: 10: Hoare triple {330#(= main_~len~0 1)} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:19,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:19,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {294#false} is VALID [2022-04-08 03:35:19,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} assume !false; {294#false} is VALID [2022-04-08 03:35:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:19,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:19,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} assume !false; {294#false} is VALID [2022-04-08 03:35:19,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {294#false} is VALID [2022-04-08 03:35:19,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:19,491 INFO L272 TraceCheckUtils]: 10: Hoare triple {357#(< (mod main_~len~0 4294967296) 5)} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:19,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(< (mod main_~len~0 4294967296) 5)} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {357#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-08 03:35:19,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#(< (mod (+ main_~len~0 1) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {357#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-08 03:35:19,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#(< (mod (+ main_~len~0 1) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {364#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:19,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#(< (mod (+ main_~len~0 1) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {364#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:19,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {364#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:19,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret6 := main(); {293#true} is VALID [2022-04-08 03:35:19,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #44#return; {293#true} is VALID [2022-04-08 03:35:19,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-08 03:35:19,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#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(8, 2);call #Ultimate.allocInit(12, 3); {293#true} is VALID [2022-04-08 03:35:19,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {293#true} is VALID [2022-04-08 03:35:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:19,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183548007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:19,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:19,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 03:35:19,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:19,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336442507] [2022-04-08 03:35:19,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336442507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:19,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:19,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:35:19,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28279278] [2022-04-08 03:35:19,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 03:35:19,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:19,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:19,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:35:19,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:35:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:35:19,507 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,633 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-08 03:35:19,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:35:19,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 03:35:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-08 03:35:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-08 03:35:19,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-08 03:35:19,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:19,662 INFO L225 Difference]: With dead ends: 31 [2022-04-08 03:35:19,662 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 03:35:19,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-08 03:35:19,663 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:19,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:35:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 03:35:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-08 03:35:19,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:19,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,669 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,669 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,670 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 03:35:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 03:35:19,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:19,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:19,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 03:35:19,671 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 03:35:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,672 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 03:35:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 03:35:19,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:19,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:19,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:19,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-08 03:35:19,673 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-08 03:35:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:19,673 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-08 03:35:19,673 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:19,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-08 03:35:19,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-08 03:35:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:35:19,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:19,689 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:19,706 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-08 03:35:19,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:19,902 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1119883018, now seen corresponding path program 3 times [2022-04-08 03:35:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:19,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655929274] [2022-04-08 03:35:19,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:19,906 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:19,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1119883018, now seen corresponding path program 4 times [2022-04-08 03:35:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:19,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960763647] [2022-04-08 03:35:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:20,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(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(8, 2);call #Ultimate.allocInit(12, 3); {539#true} is VALID [2022-04-08 03:35:20,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-08 03:35:20,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {539#true} {539#true} #44#return; {539#true} is VALID [2022-04-08 03:35:20,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:20,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#(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(8, 2);call #Ultimate.allocInit(12, 3); {539#true} is VALID [2022-04-08 03:35:20,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-08 03:35:20,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} #44#return; {539#true} is VALID [2022-04-08 03:35:20,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} call #t~ret6 := main(); {539#true} is VALID [2022-04-08 03:35:20,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {544#(= main_~len~0 0)} is VALID [2022-04-08 03:35:20,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {544#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {544#(= main_~len~0 0)} is VALID [2022-04-08 03:35:20,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {544#(= main_~len~0 0)} is VALID [2022-04-08 03:35:20,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:20,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:20,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !(4 == ~len~0 % 4294967296); {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:20,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {546#(and (<= main_~len~0 2) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:20,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#(and (<= main_~len~0 2) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {546#(and (<= main_~len~0 2) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:20,049 INFO L272 TraceCheckUtils]: 13: Hoare triple {546#(and (<= main_~len~0 2) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:20,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {547#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {548#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:20,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {548#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {540#false} is VALID [2022-04-08 03:35:20,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-04-08 03:35:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:20,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960763647] [2022-04-08 03:35:20,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960763647] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884208832] [2022-04-08 03:35:20,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:20,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:20,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:20,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:20,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 03:35:20,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:20,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:20,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 03:35:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:20,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:20,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {539#true} is VALID [2022-04-08 03:35:20,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#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(8, 2);call #Ultimate.allocInit(12, 3); {539#true} is VALID [2022-04-08 03:35:20,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-08 03:35:20,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} #44#return; {539#true} is VALID [2022-04-08 03:35:20,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} call #t~ret6 := main(); {539#true} is VALID [2022-04-08 03:35:20,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {544#(= main_~len~0 0)} is VALID [2022-04-08 03:35:20,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {544#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {544#(= main_~len~0 0)} is VALID [2022-04-08 03:35:20,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {544#(= main_~len~0 0)} is VALID [2022-04-08 03:35:20,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:20,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:20,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !(4 == ~len~0 % 4294967296); {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:20,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {545#(and (<= 1 main_~len~0) (<= main_~len~0 1))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {586#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:20,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {586#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {586#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:20,407 INFO L272 TraceCheckUtils]: 13: Hoare triple {586#(and (<= main_~len~0 2) (<= 2 main_~len~0))} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:20,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:20,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {540#false} is VALID [2022-04-08 03:35:20,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-04-08 03:35:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:20,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:20,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-04-08 03:35:20,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {540#false} is VALID [2022-04-08 03:35:20,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:20,544 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(< (mod main_~len~0 4294967296) 5)} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:20,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {613#(< (mod main_~len~0 4294967296) 5)} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {613#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-08 03:35:20,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {620#(< (mod (+ main_~len~0 1) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {613#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-08 03:35:20,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {620#(< (mod (+ main_~len~0 1) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {620#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:20,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {620#(< (mod (+ main_~len~0 1) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {620#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:20,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {630#(< (mod (+ main_~len~0 2) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {620#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:20,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {630#(< (mod (+ main_~len~0 2) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {630#(< (mod (+ main_~len~0 2) 4294967296) 5)} is VALID [2022-04-08 03:35:20,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {630#(< (mod (+ main_~len~0 2) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {630#(< (mod (+ main_~len~0 2) 4294967296) 5)} is VALID [2022-04-08 03:35:20,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {630#(< (mod (+ main_~len~0 2) 4294967296) 5)} is VALID [2022-04-08 03:35:20,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} call #t~ret6 := main(); {539#true} is VALID [2022-04-08 03:35:20,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} #44#return; {539#true} is VALID [2022-04-08 03:35:20,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-08 03:35:20,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#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(8, 2);call #Ultimate.allocInit(12, 3); {539#true} is VALID [2022-04-08 03:35:20,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {539#true} is VALID [2022-04-08 03:35:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:20,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884208832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:20,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:20,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-08 03:35:20,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:20,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655929274] [2022-04-08 03:35:20,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655929274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:20,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:20,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:35:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953496545] [2022-04-08 03:35:20,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:20,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:35:20,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:20,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:20,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:20,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:35:20,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:20,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:35:20,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:35:20,564 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:20,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:20,740 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 03:35:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:35:20,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 03:35:20,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-08 03:35:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-08 03:35:20,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-08 03:35:20,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:20,774 INFO L225 Difference]: With dead ends: 37 [2022-04-08 03:35:20,774 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 03:35:20,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-08 03:35:20,775 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:20,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 03:35:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-08 03:35:20,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:20,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:20,796 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:20,796 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:20,797 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-08 03:35:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-08 03:35:20,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:20,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:20,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 03:35:20,798 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 03:35:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:20,799 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-08 03:35:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-08 03:35:20,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:20,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:20,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:20,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-08 03:35:20,800 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-08 03:35:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:20,800 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-08 03:35:20,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:20,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-08 03:35:20,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-08 03:35:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:35:20,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:20,818 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:20,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 03:35:21,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 03:35:21,035 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1536393353, now seen corresponding path program 5 times [2022-04-08 03:35:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:21,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344482240] [2022-04-08 03:35:21,038 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:21,038 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:21,038 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:21,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1536393353, now seen corresponding path program 6 times [2022-04-08 03:35:21,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:21,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560757584] [2022-04-08 03:35:21,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:21,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:21,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {842#(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(8, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-08 03:35:21,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-08 03:35:21,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {831#true} {831#true} #44#return; {831#true} is VALID [2022-04-08 03:35:21,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {842#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:21,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {842#(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(8, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-08 03:35:21,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-08 03:35:21,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #44#return; {831#true} is VALID [2022-04-08 03:35:21,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret6 := main(); {831#true} is VALID [2022-04-08 03:35:21,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {836#(= main_~len~0 0)} is VALID [2022-04-08 03:35:21,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {836#(= main_~len~0 0)} is VALID [2022-04-08 03:35:21,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {836#(= main_~len~0 0)} is VALID [2022-04-08 03:35:21,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:21,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:21,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !(4 == ~len~0 % 4294967296); {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:21,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:21,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:21,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !(4 == ~len~0 % 4294967296); {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:21,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {839#(and (<= main_~len~0 3) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:21,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {839#(and (<= main_~len~0 3) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {839#(and (<= main_~len~0 3) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:21,134 INFO L272 TraceCheckUtils]: 16: Hoare triple {839#(and (<= main_~len~0 3) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {840#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:21,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {840#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {841#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:21,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {832#false} is VALID [2022-04-08 03:35:21,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-08 03:35:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:21,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:21,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560757584] [2022-04-08 03:35:21,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560757584] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:21,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931845173] [2022-04-08 03:35:21,135 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:21,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:21,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:21,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:21,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 03:35:21,167 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 03:35:21,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:21,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 03:35:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:21,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:21,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {831#true} is VALID [2022-04-08 03:35:21,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#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(8, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-08 03:35:21,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-08 03:35:21,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #44#return; {831#true} is VALID [2022-04-08 03:35:21,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret6 := main(); {831#true} is VALID [2022-04-08 03:35:21,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {836#(= main_~len~0 0)} is VALID [2022-04-08 03:35:21,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {836#(= main_~len~0 0)} is VALID [2022-04-08 03:35:21,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {836#(= main_~len~0 0)} is VALID [2022-04-08 03:35:21,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:21,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:21,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !(4 == ~len~0 % 4294967296); {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:21,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#(and (<= 1 main_~len~0) (<= main_~len~0 1))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:21,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:21,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !(4 == ~len~0 % 4294967296); {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:21,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#(and (<= main_~len~0 2) (<= 2 main_~len~0))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {888#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:21,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {888#(and (<= 3 main_~len~0) (<= main_~len~0 3))} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {888#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:21,408 INFO L272 TraceCheckUtils]: 16: Hoare triple {888#(and (<= 3 main_~len~0) (<= main_~len~0 3))} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {895#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:21,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {895#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {899#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:21,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {899#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {832#false} is VALID [2022-04-08 03:35:21,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-08 03:35:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:21,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:21,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-08 03:35:21,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {899#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {832#false} is VALID [2022-04-08 03:35:21,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {895#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {899#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:21,568 INFO L272 TraceCheckUtils]: 16: Hoare triple {915#(< (mod main_~len~0 4294967296) 5)} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {895#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:21,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#(< (mod main_~len~0 4294967296) 5)} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {915#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-08 03:35:21,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {922#(< (mod (+ main_~len~0 1) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {915#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-08 03:35:21,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#(< (mod (+ main_~len~0 1) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {922#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:21,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {922#(< (mod (+ main_~len~0 1) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {922#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:21,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {932#(< (mod (+ main_~len~0 2) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {922#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:21,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {932#(< (mod (+ main_~len~0 2) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {932#(< (mod (+ main_~len~0 2) 4294967296) 5)} is VALID [2022-04-08 03:35:21,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {932#(< (mod (+ main_~len~0 2) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {932#(< (mod (+ main_~len~0 2) 4294967296) 5)} is VALID [2022-04-08 03:35:21,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {942#(< (mod (+ main_~len~0 3) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {932#(< (mod (+ main_~len~0 2) 4294967296) 5)} is VALID [2022-04-08 03:35:21,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {942#(< (mod (+ main_~len~0 3) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {942#(< (mod (+ main_~len~0 3) 4294967296) 5)} is VALID [2022-04-08 03:35:21,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {942#(< (mod (+ main_~len~0 3) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {942#(< (mod (+ main_~len~0 3) 4294967296) 5)} is VALID [2022-04-08 03:35:21,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {942#(< (mod (+ main_~len~0 3) 4294967296) 5)} is VALID [2022-04-08 03:35:21,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret6 := main(); {831#true} is VALID [2022-04-08 03:35:21,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #44#return; {831#true} is VALID [2022-04-08 03:35:21,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-08 03:35:21,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#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(8, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-08 03:35:21,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {831#true} is VALID [2022-04-08 03:35:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:21,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931845173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:21,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:21,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 03:35:21,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344482240] [2022-04-08 03:35:21,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344482240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:21,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:21,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:35:21,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201334331] [2022-04-08 03:35:21,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:21,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 03:35:21,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:21,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:21,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:35:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:35:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-04-08 03:35:21,592 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:21,825 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-08 03:35:21,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:35:21,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 03:35:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-08 03:35:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-08 03:35:21,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-08 03:35:21,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:21,859 INFO L225 Difference]: With dead ends: 43 [2022-04-08 03:35:21,859 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 03:35:21,860 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-08 03:35:21,860 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:21,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 41 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 03:35:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-08 03:35:21,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:21,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,877 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,877 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:21,878 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-08 03:35:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-08 03:35:21,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:21,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:21,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-08 03:35:21,879 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-08 03:35:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:21,879 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-08 03:35:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-08 03:35:21,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:21,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:21,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:21,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-08 03:35:21,881 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2022-04-08 03:35:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:21,881 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-08 03:35:21,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:21,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-08 03:35:21,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-08 03:35:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 03:35:21,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:21,902 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:21,920 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-08 03:35:22,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:22,119 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1635265194, now seen corresponding path program 7 times [2022-04-08 03:35:22,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:22,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1139285604] [2022-04-08 03:35:22,122 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:22,122 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:22,122 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1635265194, now seen corresponding path program 8 times [2022-04-08 03:35:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:22,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008303939] [2022-04-08 03:35:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:22,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {1181#(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(8, 2);call #Ultimate.allocInit(12, 3); {1169#true} is VALID [2022-04-08 03:35:22,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1169#true} assume true; {1169#true} is VALID [2022-04-08 03:35:22,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1169#true} {1169#true} #44#return; {1169#true} is VALID [2022-04-08 03:35:22,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {1169#true} call ULTIMATE.init(); {1181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:22,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#(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(8, 2);call #Ultimate.allocInit(12, 3); {1169#true} is VALID [2022-04-08 03:35:22,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {1169#true} assume true; {1169#true} is VALID [2022-04-08 03:35:22,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1169#true} {1169#true} #44#return; {1169#true} is VALID [2022-04-08 03:35:22,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {1169#true} call #t~ret6 := main(); {1169#true} is VALID [2022-04-08 03:35:22,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {1169#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {1174#(= main_~len~0 0)} is VALID [2022-04-08 03:35:22,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1174#(= main_~len~0 0)} is VALID [2022-04-08 03:35:22,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {1174#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {1174#(= main_~len~0 0)} is VALID [2022-04-08 03:35:22,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {1174#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:22,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:22,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !(4 == ~len~0 % 4294967296); {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:22,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:22,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:22,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !(4 == ~len~0 % 4294967296); {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:22,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:22,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:22,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} assume !(4 == ~len~0 % 4294967296); {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:22,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1178#(and (<= main_~len~0 4) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:22,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(and (<= main_~len~0 4) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {1178#(and (<= main_~len~0 4) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:22,232 INFO L272 TraceCheckUtils]: 19: Hoare triple {1178#(and (<= main_~len~0 4) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {1179#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:35:22,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1180#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:35:22,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {1180#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1170#false} is VALID [2022-04-08 03:35:22,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {1170#false} assume !false; {1170#false} is VALID [2022-04-08 03:35:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:22,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008303939] [2022-04-08 03:35:22,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008303939] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:22,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139886109] [2022-04-08 03:35:22,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:22,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:22,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 03:35:22,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:22,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:22,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 03:35:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:22,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:22,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {1169#true} call ULTIMATE.init(); {1169#true} is VALID [2022-04-08 03:35:22,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1169#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(8, 2);call #Ultimate.allocInit(12, 3); {1169#true} is VALID [2022-04-08 03:35:22,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1169#true} assume true; {1169#true} is VALID [2022-04-08 03:35:22,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1169#true} {1169#true} #44#return; {1169#true} is VALID [2022-04-08 03:35:22,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {1169#true} call #t~ret6 := main(); {1169#true} is VALID [2022-04-08 03:35:22,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {1169#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {1174#(= main_~len~0 0)} is VALID [2022-04-08 03:35:22,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {1174#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1174#(= main_~len~0 0)} is VALID [2022-04-08 03:35:22,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {1174#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {1174#(= main_~len~0 0)} is VALID [2022-04-08 03:35:22,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {1174#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:22,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:22,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !(4 == ~len~0 % 4294967296); {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:22,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#(and (<= 1 main_~len~0) (<= main_~len~0 1))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:22,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:22,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !(4 == ~len~0 % 4294967296); {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:22,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {1176#(and (<= main_~len~0 2) (<= 2 main_~len~0))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:22,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:22,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} assume !(4 == ~len~0 % 4294967296); {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:22,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {1177#(and (<= 3 main_~len~0) (<= main_~len~0 3))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1236#(and (<= main_~len~0 4) (<= 4 main_~len~0))} is VALID [2022-04-08 03:35:22,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {1236#(and (<= main_~len~0 4) (<= 4 main_~len~0))} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {1236#(and (<= main_~len~0 4) (<= 4 main_~len~0))} is VALID [2022-04-08 03:35:22,515 INFO L272 TraceCheckUtils]: 19: Hoare triple {1236#(and (<= main_~len~0 4) (<= 4 main_~len~0))} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {1243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:22,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {1243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:22,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {1247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1170#false} is VALID [2022-04-08 03:35:22,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {1170#false} assume !false; {1170#false} is VALID [2022-04-08 03:35:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:22,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:22,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {1170#false} assume !false; {1170#false} is VALID [2022-04-08 03:35:22,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {1247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1170#false} is VALID [2022-04-08 03:35:22,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {1243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 03:35:22,684 INFO L272 TraceCheckUtils]: 19: Hoare triple {1263#(< (mod main_~len~0 4294967296) 5)} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {1243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 03:35:22,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1263#(< (mod main_~len~0 4294967296) 5)} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {1263#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-08 03:35:22,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1270#(< (mod (+ main_~len~0 1) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1263#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-08 03:35:22,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {1270#(< (mod (+ main_~len~0 1) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {1270#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:22,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#(< (mod (+ main_~len~0 1) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1270#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:22,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#(< (mod (+ main_~len~0 2) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1270#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-08 03:35:22,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#(< (mod (+ main_~len~0 2) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {1280#(< (mod (+ main_~len~0 2) 4294967296) 5)} is VALID [2022-04-08 03:35:22,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1280#(< (mod (+ main_~len~0 2) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1280#(< (mod (+ main_~len~0 2) 4294967296) 5)} is VALID [2022-04-08 03:35:22,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {1290#(< (mod (+ main_~len~0 3) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1280#(< (mod (+ main_~len~0 2) 4294967296) 5)} is VALID [2022-04-08 03:35:22,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {1290#(< (mod (+ main_~len~0 3) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {1290#(< (mod (+ main_~len~0 3) 4294967296) 5)} is VALID [2022-04-08 03:35:22,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(< (mod (+ main_~len~0 3) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1290#(< (mod (+ main_~len~0 3) 4294967296) 5)} is VALID [2022-04-08 03:35:22,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {1300#(< (mod (+ main_~len~0 4) 4294967296) 5)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1290#(< (mod (+ main_~len~0 3) 4294967296) 5)} is VALID [2022-04-08 03:35:22,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#(< (mod (+ main_~len~0 4) 4294967296) 5)} assume !(4 == ~len~0 % 4294967296); {1300#(< (mod (+ main_~len~0 4) 4294967296) 5)} is VALID [2022-04-08 03:35:22,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1300#(< (mod (+ main_~len~0 4) 4294967296) 5)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1300#(< (mod (+ main_~len~0 4) 4294967296) 5)} is VALID [2022-04-08 03:35:22,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {1169#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {1300#(< (mod (+ main_~len~0 4) 4294967296) 5)} is VALID [2022-04-08 03:35:22,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1169#true} call #t~ret6 := main(); {1169#true} is VALID [2022-04-08 03:35:22,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1169#true} {1169#true} #44#return; {1169#true} is VALID [2022-04-08 03:35:22,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1169#true} assume true; {1169#true} is VALID [2022-04-08 03:35:22,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1169#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(8, 2);call #Ultimate.allocInit(12, 3); {1169#true} is VALID [2022-04-08 03:35:22,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1169#true} call ULTIMATE.init(); {1169#true} is VALID [2022-04-08 03:35:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:22,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139886109] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:22,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:22,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 03:35:22,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:22,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1139285604] [2022-04-08 03:35:22,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1139285604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:22,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:22,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:35:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357662568] [2022-04-08 03:35:22,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:22,692 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 03:35:22,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:22,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:22,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:22,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:35:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:22,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:35:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-04-08 03:35:22,709 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:22,983 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-08 03:35:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:35:22,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 03:35:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-08 03:35:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-08 03:35:22,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2022-04-08 03:35:23,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:23,011 INFO L225 Difference]: With dead ends: 34 [2022-04-08 03:35:23,011 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 03:35:23,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-04-08 03:35:23,014 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:23,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 41 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 03:35:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-08 03:35:23,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:23,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:23,044 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:23,045 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:23,046 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-08 03:35:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-08 03:35:23,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:23,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:23,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 03:35:23,046 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 03:35:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:23,049 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-08 03:35:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-08 03:35:23,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:23,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:23,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:23,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-08 03:35:23,050 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2022-04-08 03:35:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:23,050 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-08 03:35:23,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:23,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-08 03:35:23,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-08 03:35:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 03:35:23,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:23,071 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:23,089 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-08 03:35:23,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:23,290 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:23,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash 778715369, now seen corresponding path program 9 times [2022-04-08 03:35:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:23,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2107779384] [2022-04-08 03:35:23,294 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:23,294 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-08 03:35:23,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash 778715369, now seen corresponding path program 10 times [2022-04-08 03:35:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:23,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125469085] [2022-04-08 03:35:23,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:23,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:23,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {1531#(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(8, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-08 03:35:23,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-08 03:35:23,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1521#true} {1521#true} #44#return; {1521#true} is VALID [2022-04-08 03:35:23,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:23,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#(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(8, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-08 03:35:23,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-08 03:35:23,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #44#return; {1521#true} is VALID [2022-04-08 03:35:23,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret6 := main(); {1521#true} is VALID [2022-04-08 03:35:23,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {1526#(= main_~len~0 0)} is VALID [2022-04-08 03:35:23,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {1526#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1526#(= main_~len~0 0)} is VALID [2022-04-08 03:35:23,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {1526#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {1526#(= main_~len~0 0)} is VALID [2022-04-08 03:35:23,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {1526#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:23,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:23,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !(4 == ~len~0 % 4294967296); {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:23,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:23,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:23,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !(4 == ~len~0 % 4294967296); {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:23,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:23,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:23,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} assume !(4 == ~len~0 % 4294967296); {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:23,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1530#(and (<= main_~len~0 (+ (* (div main_~len~0 4294967296) 4294967296) 4)) (<= (div main_~len~0 4294967296) 0) (not (<= (+ (div main_~len~0 4294967296) 1) 0)) (< (+ (* (div main_~len~0 4294967296) 4294967296) 3) main_~len~0))} is VALID [2022-04-08 03:35:23,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {1530#(and (<= main_~len~0 (+ (* (div main_~len~0 4294967296) 4294967296) 4)) (<= (div main_~len~0 4294967296) 0) (not (<= (+ (div main_~len~0 4294967296) 1) 0)) (< (+ (* (div main_~len~0 4294967296) 4294967296) 3) main_~len~0))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1530#(and (<= main_~len~0 (+ (* (div main_~len~0 4294967296) 4294967296) 4)) (<= (div main_~len~0 4294967296) 0) (not (<= (+ (div main_~len~0 4294967296) 1) 0)) (< (+ (* (div main_~len~0 4294967296) 4294967296) 3) main_~len~0))} is VALID [2022-04-08 03:35:23,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#(and (<= main_~len~0 (+ (* (div main_~len~0 4294967296) 4294967296) 4)) (<= (div main_~len~0 4294967296) 0) (not (<= (+ (div main_~len~0 4294967296) 1) 0)) (< (+ (* (div main_~len~0 4294967296) 4294967296) 3) main_~len~0))} assume !(4 == ~len~0 % 4294967296); {1522#false} is VALID [2022-04-08 03:35:23,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {1522#false} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1522#false} is VALID [2022-04-08 03:35:23,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {1522#false} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {1522#false} is VALID [2022-04-08 03:35:23,434 INFO L272 TraceCheckUtils]: 22: Hoare triple {1522#false} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {1522#false} is VALID [2022-04-08 03:35:23,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-08 03:35:23,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-08 03:35:23,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-08 03:35:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:23,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:23,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125469085] [2022-04-08 03:35:23,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125469085] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:23,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357924032] [2022-04-08 03:35:23,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:23,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:23,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:23,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:35:23,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 03:35:23,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:23,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:23,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 03:35:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:23,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:24,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-08 03:35:24,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#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(8, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-08 03:35:24,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-08 03:35:24,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #44#return; {1521#true} is VALID [2022-04-08 03:35:24,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret6 := main(); {1521#true} is VALID [2022-04-08 03:35:24,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {1526#(= main_~len~0 0)} is VALID [2022-04-08 03:35:24,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {1526#(= main_~len~0 0)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1526#(= main_~len~0 0)} is VALID [2022-04-08 03:35:24,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {1526#(= main_~len~0 0)} assume !(4 == ~len~0 % 4294967296); {1526#(= main_~len~0 0)} is VALID [2022-04-08 03:35:24,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {1526#(= main_~len~0 0)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:24,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:24,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} assume !(4 == ~len~0 % 4294967296); {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} is VALID [2022-04-08 03:35:24,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {1527#(and (<= 1 main_~len~0) (<= main_~len~0 1))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:24,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:24,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} assume !(4 == ~len~0 % 4294967296); {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} is VALID [2022-04-08 03:35:24,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#(and (<= main_~len~0 2) (<= 2 main_~len~0))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:24,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:24,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} assume !(4 == ~len~0 % 4294967296); {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} is VALID [2022-04-08 03:35:24,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(and (<= 3 main_~len~0) (<= main_~len~0 3))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1530#(and (<= main_~len~0 (+ (* (div main_~len~0 4294967296) 4294967296) 4)) (<= (div main_~len~0 4294967296) 0) (not (<= (+ (div main_~len~0 4294967296) 1) 0)) (< (+ (* (div main_~len~0 4294967296) 4294967296) 3) main_~len~0))} is VALID [2022-04-08 03:35:24,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {1530#(and (<= main_~len~0 (+ (* (div main_~len~0 4294967296) 4294967296) 4)) (<= (div main_~len~0 4294967296) 0) (not (<= (+ (div main_~len~0 4294967296) 1) 0)) (< (+ (* (div main_~len~0 4294967296) 4294967296) 3) main_~len~0))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1530#(and (<= main_~len~0 (+ (* (div main_~len~0 4294967296) 4294967296) 4)) (<= (div main_~len~0 4294967296) 0) (not (<= (+ (div main_~len~0 4294967296) 1) 0)) (< (+ (* (div main_~len~0 4294967296) 4294967296) 3) main_~len~0))} is VALID [2022-04-08 03:35:24,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#(and (<= main_~len~0 (+ (* (div main_~len~0 4294967296) 4294967296) 4)) (<= (div main_~len~0 4294967296) 0) (not (<= (+ (div main_~len~0 4294967296) 1) 0)) (< (+ (* (div main_~len~0 4294967296) 4294967296) 3) main_~len~0))} assume !(4 == ~len~0 % 4294967296); {1522#false} is VALID [2022-04-08 03:35:24,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {1522#false} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1522#false} is VALID [2022-04-08 03:35:24,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {1522#false} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {1522#false} is VALID [2022-04-08 03:35:24,518 INFO L272 TraceCheckUtils]: 22: Hoare triple {1522#false} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {1522#false} is VALID [2022-04-08 03:35:24,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-08 03:35:24,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-08 03:35:24,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-08 03:35:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:24,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:24,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-08 03:35:24,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-08 03:35:24,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-08 03:35:24,638 INFO L272 TraceCheckUtils]: 22: Hoare triple {1522#false} call __VERIFIER_assert((if ~len~0 % 4294967296 >= 0 && ~len~0 % 4294967296 < 5 then 1 else 0)); {1522#false} is VALID [2022-04-08 03:35:24,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {1522#false} assume !(0 != #t~nondet4 % 256);havoc #t~nondet4; {1522#false} is VALID [2022-04-08 03:35:24,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {1522#false} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1522#false} is VALID [2022-04-08 03:35:24,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {1628#(= (mod main_~len~0 4294967296) 4)} assume !(4 == ~len~0 % 4294967296); {1522#false} is VALID [2022-04-08 03:35:24,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {1628#(= (mod main_~len~0 4294967296) 4)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1628#(= (mod main_~len~0 4294967296) 4)} is VALID [2022-04-08 03:35:24,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {1635#(= (mod (+ main_~len~0 1) 4294967296) 4)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1628#(= (mod main_~len~0 4294967296) 4)} is VALID [2022-04-08 03:35:24,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {1635#(= (mod (+ main_~len~0 1) 4294967296) 4)} assume !(4 == ~len~0 % 4294967296); {1635#(= (mod (+ main_~len~0 1) 4294967296) 4)} is VALID [2022-04-08 03:35:24,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {1635#(= (mod (+ main_~len~0 1) 4294967296) 4)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1635#(= (mod (+ main_~len~0 1) 4294967296) 4)} is VALID [2022-04-08 03:35:24,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {1645#(= (mod (+ main_~len~0 2) 4294967296) 4)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1635#(= (mod (+ main_~len~0 1) 4294967296) 4)} is VALID [2022-04-08 03:35:24,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {1645#(= (mod (+ main_~len~0 2) 4294967296) 4)} assume !(4 == ~len~0 % 4294967296); {1645#(= (mod (+ main_~len~0 2) 4294967296) 4)} is VALID [2022-04-08 03:35:24,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#(= (mod (+ main_~len~0 2) 4294967296) 4)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1645#(= (mod (+ main_~len~0 2) 4294967296) 4)} is VALID [2022-04-08 03:35:24,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {1655#(= (mod (+ main_~len~0 3) 4294967296) 4)} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1645#(= (mod (+ main_~len~0 2) 4294967296) 4)} is VALID [2022-04-08 03:35:24,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {1655#(= (mod (+ main_~len~0 3) 4294967296) 4)} assume !(4 == ~len~0 % 4294967296); {1655#(= (mod (+ main_~len~0 3) 4294967296) 4)} is VALID [2022-04-08 03:35:24,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {1655#(= (mod (+ main_~len~0 3) 4294967296) 4)} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1655#(= (mod (+ main_~len~0 3) 4294967296) 4)} is VALID [2022-04-08 03:35:24,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {1665#(= 4 (mod (+ main_~len~0 4) 4294967296))} ~a~0 := ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];#t~post5 := ~len~0;~len~0 := 1 + #t~post5;havoc #t~post5; {1655#(= (mod (+ main_~len~0 3) 4294967296) 4)} is VALID [2022-04-08 03:35:24,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#(= 4 (mod (+ main_~len~0 4) 4294967296))} assume !(4 == ~len~0 % 4294967296); {1665#(= 4 (mod (+ main_~len~0 4) 4294967296))} is VALID [2022-04-08 03:35:24,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {1665#(= 4 (mod (+ main_~len~0 4) 4294967296))} assume !!(0 != #t~nondet4 % 256);havoc #t~nondet4; {1665#(= 4 (mod (+ main_~len~0 4) 4294967296))} is VALID [2022-04-08 03:35:24,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} havoc ~a~0;~len~0 := 0;havoc ~i~0; {1665#(= 4 (mod (+ main_~len~0 4) 4294967296))} is VALID [2022-04-08 03:35:24,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret6 := main(); {1521#true} is VALID [2022-04-08 03:35:24,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #44#return; {1521#true} is VALID [2022-04-08 03:35:24,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-08 03:35:24,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#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(8, 2);call #Ultimate.allocInit(12, 3); {1521#true} is VALID [2022-04-08 03:35:24,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-08 03:35:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:35:24,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357924032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:24,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:24,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-08 03:35:24,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:24,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2107779384] [2022-04-08 03:35:24,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2107779384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:24,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:24,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:35:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864991652] [2022-04-08 03:35:24,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:24,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 03:35:24,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:24,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:24,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:24,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:35:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:24,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:35:24,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:35:24,677 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:24,890 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-08 03:35:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:35:24,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 03:35:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-08 03:35:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-08 03:35:24,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-08 03:35:24,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:24,915 INFO L225 Difference]: With dead ends: 39 [2022-04-08 03:35:24,915 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:35:24,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-04-08 03:35:24,916 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:24,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:35:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:35:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:35:24,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:24,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:35:24,917 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:35:24,917 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:35:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:24,917 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:35:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:35:24,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:24,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:24,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:35:24,917 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 03:35:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:24,917 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:35:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:35:24,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:24,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:24,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:24,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 03:35:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:35:24,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-08 03:35:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:24,918 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:35:24,918 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:35:24,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:35:24,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:35:24,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:24,921 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:35:24,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 03:35:25,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:25,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:35:25,273 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 03:35:25,273 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 03:35:25,273 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 03:35:25,273 INFO L885 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: true [2022-04-08 03:35:25,273 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 14 34) the Hoare annotation is: true [2022-04-08 03:35:25,273 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 14 34) the Hoare annotation is: true [2022-04-08 03:35:25,273 INFO L878 garLoopResultBuilder]: At program point L23(lines 23 24) the Hoare annotation is: (let ((.cse0 (div main_~len~0 4294967296))) (and (<= main_~len~0 (+ (* .cse0 4294967296) 4)) (<= .cse0 0) (not (<= (+ .cse0 1) 0)))) [2022-04-08 03:35:25,273 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 24) the Hoare annotation is: (or (and (<= 3 main_~len~0) (<= main_~len~0 3)) (and (<= main_~len~0 2) (<= 2 main_~len~0)) (= main_~len~0 0) (and (<= 1 main_~len~0) (<= main_~len~0 1))) [2022-04-08 03:35:25,273 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 29) the Hoare annotation is: (let ((.cse0 (div main_~len~0 4294967296))) (and (<= main_~len~0 (+ (* .cse0 4294967296) 4)) (<= .cse0 0) (not (<= (+ .cse0 1) 0)))) [2022-04-08 03:35:25,273 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 29) the Hoare annotation is: (and (<= main_~len~0 4) (not (<= (+ (div main_~len~0 4294967296) 1) 0))) [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 14 34) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:35:25,274 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 03:35:25,274 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-08 03:35:25,274 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 03:35:25,276 INFO L719 BasicCegarLoop]: Path program histogram: [10, 2, 2] [2022-04-08 03:35:25,277 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:35:25,279 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:35:25,281 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 03:35:25,289 INFO L163 areAnnotationChecker]: CFG has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 03:35:25,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:35:25 BoogieIcfgContainer [2022-04-08 03:35:25,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:35:25,294 INFO L158 Benchmark]: Toolchain (without parser) took 7438.29ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 120.5MB in the beginning and 164.5MB in the end (delta: -43.9MB). Peak memory consumption was 53.3MB. Max. memory is 8.0GB. [2022-04-08 03:35:25,295 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:35:25,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.75ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 120.3MB in the beginning and 199.0MB in the end (delta: -78.7MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. [2022-04-08 03:35:25,295 INFO L158 Benchmark]: Boogie Preprocessor took 33.60ms. Allocated memory is still 226.5MB. Free memory was 199.0MB in the beginning and 197.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:35:25,295 INFO L158 Benchmark]: RCFGBuilder took 243.62ms. Allocated memory is still 226.5MB. Free memory was 197.4MB in the beginning and 186.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 03:35:25,295 INFO L158 Benchmark]: TraceAbstraction took 6945.63ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 186.4MB in the beginning and 164.5MB in the end (delta: 22.0MB). Peak memory consumption was 69.1MB. Max. memory is 8.0GB. [2022-04-08 03:35:25,296 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.75ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 120.3MB in the beginning and 199.0MB in the end (delta: -78.7MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.60ms. Allocated memory is still 226.5MB. Free memory was 199.0MB in the beginning and 197.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 243.62ms. Allocated memory is still 226.5MB. Free memory was 197.4MB in the beginning and 186.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6945.63ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 186.4MB in the beginning and 164.5MB in the end (delta: 22.0MB). Peak memory consumption was 69.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 97 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 177 SyntacticMatches, 9 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 81 PreInvPairs, 125 NumberOfFragments, 117 HoareAnnotationTreeSize, 81 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 164 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (len <= len / 4294967296 * 4294967296 + 4 && len / 4294967296 <= 0) && !(len / 4294967296 + 1 <= 0) - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 03:35:25,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...