/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:01:29,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:01:29,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:01:29,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:01:29,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:01:29,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:01:29,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:01:29,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:01:29,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:01:29,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:01:29,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:01:29,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:01:29,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:01:29,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:01:29,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:01:29,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:01:29,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:01:29,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:01:29,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:01:29,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:01:29,948 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:01:29,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:01:29,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:01:29,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:01:29,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:01:29,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:01:29,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:01:29,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:01:29,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:01:29,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:01:29,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:01:29,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:01:29,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:01:29,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:01:29,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:01:29,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:01:29,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:01:29,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:01:29,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:01:29,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:01:29,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:01:29,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:01:29,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:01:29,980 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:01:29,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:01:29,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:01:29,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:01:29,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:01:29,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:01:29,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:01:29,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:01:29,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:01:29,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:01:29,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:01:29,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:01:29,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:01:29,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:01:29,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:01:29,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:29,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:01:29,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:01:29,984 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:01:29,984 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:01:29,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:01:29,985 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:01:29,985 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 15:01:30,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:01:30,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:01:30,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:01:30,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:01:30,217 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:01:30,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-04-28 15:01:30,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccfedff7a/a493dd28b6c849b49f16711463e17fdc/FLAGf7f5249f9 [2022-04-28 15:01:30,590 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:01:30,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-28 15:01:30,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccfedff7a/a493dd28b6c849b49f16711463e17fdc/FLAGf7f5249f9 [2022-04-28 15:01:30,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccfedff7a/a493dd28b6c849b49f16711463e17fdc [2022-04-28 15:01:31,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:01:31,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:01:31,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:31,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:01:31,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:01:31,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:30" (1/1) ... [2022-04-28 15:01:31,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad93fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31, skipping insertion in model container [2022-04-28 15:01:31,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:30" (1/1) ... [2022-04-28 15:01:31,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:01:31,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:01:31,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-04-28 15:01:31,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:31,186 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:01:31,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-04-28 15:01:31,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:01:31,221 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:01:31,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31 WrapperNode [2022-04-28 15:01:31,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:01:31,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:01:31,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:01:31,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:01:31,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31" (1/1) ... [2022-04-28 15:01:31,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31" (1/1) ... [2022-04-28 15:01:31,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31" (1/1) ... [2022-04-28 15:01:31,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31" (1/1) ... [2022-04-28 15:01:31,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31" (1/1) ... [2022-04-28 15:01:31,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31" (1/1) ... [2022-04-28 15:01:31,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31" (1/1) ... [2022-04-28 15:01:31,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:01:31,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:01:31,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:01:31,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:01:31,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31" (1/1) ... [2022-04-28 15:01:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:01:31,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:01:31,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 15:01:31,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 15:01:31,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:01:31,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:01:31,321 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:01:31,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:01:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:01:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:01:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:01:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:01:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:01:31,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:01:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:01:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:01:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:01:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:01:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:01:31,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:01:31,384 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:01:31,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:01:31,586 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:01:31,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:01:31,592 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:01:31,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:31 BoogieIcfgContainer [2022-04-28 15:01:31,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:01:31,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:01:31,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:01:31,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:01:31,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:01:30" (1/3) ... [2022-04-28 15:01:31,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8efa42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:31, skipping insertion in model container [2022-04-28 15:01:31,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:31" (2/3) ... [2022-04-28 15:01:31,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8efa42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:31, skipping insertion in model container [2022-04-28 15:01:31,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:31" (3/3) ... [2022-04-28 15:01:31,600 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-04-28 15:01:31,611 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:01:31,612 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:01:31,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:01:31,665 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b8adc83, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bd26ebd [2022-04-28 15:01:31,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:01:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 15:01:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 15:01:31,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:31,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:31,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 1 times [2022-04-28 15:01:31,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:31,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957023020] [2022-04-28 15:01:31,722 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 2 times [2022-04-28 15:01:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:31,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363095107] [2022-04-28 15:01:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:31,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(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(15, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-28 15:01:31,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 15:01:31,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-28 15:01:31,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:31,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(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(15, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-28 15:01:31,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 15:01:31,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-28 15:01:31,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret13 := main(); {42#true} is VALID [2022-04-28 15:01:31,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {42#true} is VALID [2022-04-28 15:01:31,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {42#true} is VALID [2022-04-28 15:01:31,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {42#true} is VALID [2022-04-28 15:01:31,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 != ~p1~0;~lk1~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:31,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {47#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:31,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:31,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:31,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:31,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:31,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:31,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:31,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p1~0; {47#(= main_~lk1~0 1)} is VALID [2022-04-28 15:01:31,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {43#false} is VALID [2022-04-28 15:01:31,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 15:01:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:31,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363095107] [2022-04-28 15:01:31,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363095107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:31,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:31,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:31,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:31,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957023020] [2022-04-28 15:01:31,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957023020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:31,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:31,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:31,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106930216] [2022-04-28 15:01:31,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:31,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 15:01:31,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:31,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:32,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:32,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:32,029 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:32,348 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-04-28 15:01:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:32,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 15:01:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 15:01:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 15:01:32,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 15:01:32,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:32,498 INFO L225 Difference]: With dead ends: 76 [2022-04-28 15:01:32,499 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 15:01:32,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:32,506 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:32,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 15:01:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 15:01:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-28 15:01:32,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:32,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,553 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,554 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:32,563 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-28 15:01:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-28 15:01:32,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:32,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:32,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 15:01:32,569 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 15:01:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:32,578 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-28 15:01:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-28 15:01:32,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:32,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:32,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:32,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-28 15:01:32,584 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-28 15:01:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:32,585 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-28 15:01:32,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 74 transitions. [2022-04-28 15:01:32,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-28 15:01:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 15:01:32,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:32,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:32,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:01:32,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 1 times [2022-04-28 15:01:32,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:32,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894958191] [2022-04-28 15:01:32,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 2 times [2022-04-28 15:01:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:32,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774316758] [2022-04-28 15:01:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:32,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:32,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#(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(15, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 15:01:32,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 15:01:32,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-28 15:01:32,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:32,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#(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(15, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 15:01:32,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 15:01:32,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-28 15:01:32,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret13 := main(); {414#true} is VALID [2022-04-28 15:01:32,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {414#true} is VALID [2022-04-28 15:01:32,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {414#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {414#true} is VALID [2022-04-28 15:01:32,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {414#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {414#true} is VALID [2022-04-28 15:01:32,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {414#true} assume !(0 != ~p1~0); {419#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:32,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(= main_~p1~0 0)} assume !(0 != ~p2~0); {419#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:32,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:32,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:32,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:32,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:32,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:32,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-28 15:01:32,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p1~0; {415#false} is VALID [2022-04-28 15:01:32,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {415#false} assume 1 != ~lk1~0; {415#false} is VALID [2022-04-28 15:01:32,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 15:01:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:32,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:32,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774316758] [2022-04-28 15:01:32,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774316758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:32,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:32,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:32,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894958191] [2022-04-28 15:01:32,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894958191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:32,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:32,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:32,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537564230] [2022-04-28 15:01:32,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:32,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 15:01:32,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:32,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:32,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:32,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:32,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:32,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:32,790 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:33,014 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-04-28 15:01:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 15:01:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 15:01:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-28 15:01:33,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-28 15:01:33,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:33,178 INFO L225 Difference]: With dead ends: 98 [2022-04-28 15:01:33,179 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 15:01:33,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:33,180 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:33,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 15:01:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-28 15:01:33,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:33,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,192 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,193 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:33,195 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-28 15:01:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-28 15:01:33,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:33,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:33,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 15:01:33,197 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 15:01:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:33,200 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-28 15:01:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-28 15:01:33,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:33,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:33,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:33,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-28 15:01:33,204 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-28 15:01:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:33,204 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-28 15:01:33,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 102 transitions. [2022-04-28 15:01:33,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-28 15:01:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:33,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:33,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:33,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:01:33,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 1 times [2022-04-28 15:01:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:33,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2017511315] [2022-04-28 15:01:33,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 2 times [2022-04-28 15:01:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:33,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785193053] [2022-04-28 15:01:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:33,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#(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(15, 2);call #Ultimate.allocInit(12, 3); {862#true} is VALID [2022-04-28 15:01:33,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-28 15:01:33,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-28 15:01:33,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:33,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#(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(15, 2);call #Ultimate.allocInit(12, 3); {862#true} is VALID [2022-04-28 15:01:33,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-28 15:01:33,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-28 15:01:33,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret13 := main(); {862#true} is VALID [2022-04-28 15:01:33,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {862#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {862#true} is VALID [2022-04-28 15:01:33,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {862#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {862#true} is VALID [2022-04-28 15:01:33,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {862#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {862#true} is VALID [2022-04-28 15:01:33,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {862#true} assume 0 != ~p1~0;~lk1~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:33,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:33,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:33,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:33,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:33,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:33,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:33,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-28 15:01:33,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {867#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {863#false} is VALID [2022-04-28 15:01:33,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {863#false} assume 0 != ~p2~0; {863#false} is VALID [2022-04-28 15:01:33,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {863#false} assume 1 != ~lk2~0; {863#false} is VALID [2022-04-28 15:01:33,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {863#false} assume !false; {863#false} is VALID [2022-04-28 15:01:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:33,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:33,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785193053] [2022-04-28 15:01:33,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785193053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:33,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:33,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:33,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:33,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2017511315] [2022-04-28 15:01:33,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2017511315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:33,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:33,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408922837] [2022-04-28 15:01:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:33,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:33,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:33,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:33,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:33,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:33,441 INFO L87 Difference]: Start difference. First operand 59 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:33,601 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-04-28 15:01:33,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:33,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:33,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 15:01:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-28 15:01:33,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-28 15:01:33,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:33,722 INFO L225 Difference]: With dead ends: 91 [2022-04-28 15:01:33,722 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 15:01:33,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:33,724 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:33,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 15:01:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-28 15:01:33,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:33,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,733 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,733 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:33,736 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-28 15:01:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-28 15:01:33,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:33,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:33,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 15:01:33,737 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 15:01:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:33,740 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-28 15:01:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-28 15:01:33,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:33,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:33,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:33,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-28 15:01:33,743 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-28 15:01:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:33,743 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-28 15:01:33,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 104 transitions. [2022-04-28 15:01:33,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-28 15:01:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:33,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:33,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:33,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:01:33,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 1 times [2022-04-28 15:01:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:33,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700372781] [2022-04-28 15:01:33,837 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 2 times [2022-04-28 15:01:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:33,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521290144] [2022-04-28 15:01:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:33,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:33,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {1314#(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(15, 2);call #Ultimate.allocInit(12, 3); {1308#true} is VALID [2022-04-28 15:01:33,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-28 15:01:33,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-28 15:01:33,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {1308#true} call ULTIMATE.init(); {1314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:33,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {1314#(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(15, 2);call #Ultimate.allocInit(12, 3); {1308#true} is VALID [2022-04-28 15:01:33,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-28 15:01:33,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-28 15:01:33,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {1308#true} call #t~ret13 := main(); {1308#true} is VALID [2022-04-28 15:01:33,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {1308#true} is VALID [2022-04-28 15:01:33,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {1308#true} is VALID [2022-04-28 15:01:33,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1308#true} is VALID [2022-04-28 15:01:33,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#true} assume !(0 != ~p1~0); {1308#true} is VALID [2022-04-28 15:01:33,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {1308#true} assume !(0 != ~p2~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:33,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:33,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:33,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:33,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:33,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:33,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:33,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-28 15:01:33,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p2~0; {1309#false} is VALID [2022-04-28 15:01:33,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {1309#false} assume 1 != ~lk2~0; {1309#false} is VALID [2022-04-28 15:01:33,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-04-28 15:01:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:33,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521290144] [2022-04-28 15:01:33,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521290144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:33,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:33,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:33,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:33,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [700372781] [2022-04-28 15:01:33,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [700372781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:33,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:33,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127427086] [2022-04-28 15:01:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:33,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:33,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:33,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:33,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:33,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:33,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:33,908 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,059 INFO L93 Difference]: Finished difference Result 166 states and 288 transitions. [2022-04-28 15:01:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:34,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 15:01:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-28 15:01:34,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-28 15:01:34,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:34,182 INFO L225 Difference]: With dead ends: 166 [2022-04-28 15:01:34,182 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 15:01:34,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:34,185 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:34,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 67 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 15:01:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-28 15:01:34,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:34,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,214 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,215 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,219 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-28 15:01:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-28 15:01:34,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:34,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:34,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-28 15:01:34,223 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-28 15:01:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,229 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-28 15:01:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-28 15:01:34,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:34,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:34,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:34,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2022-04-28 15:01:34,235 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 20 [2022-04-28 15:01:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:34,235 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2022-04-28 15:01:34,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 189 transitions. [2022-04-28 15:01:34,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2022-04-28 15:01:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 15:01:34,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:34,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:34,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:01:34,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:34,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:34,451 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 1 times [2022-04-28 15:01:34,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:34,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1544807651] [2022-04-28 15:01:34,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:34,452 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 2 times [2022-04-28 15:01:34,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:34,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737677131] [2022-04-28 15:01:34,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:34,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:34,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {2106#(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(15, 2);call #Ultimate.allocInit(12, 3); {2100#true} is VALID [2022-04-28 15:01:34,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-28 15:01:34,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-28 15:01:34,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {2100#true} call ULTIMATE.init(); {2106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:34,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {2106#(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(15, 2);call #Ultimate.allocInit(12, 3); {2100#true} is VALID [2022-04-28 15:01:34,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-28 15:01:34,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-28 15:01:34,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {2100#true} call #t~ret13 := main(); {2100#true} is VALID [2022-04-28 15:01:34,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {2100#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {2100#true} is VALID [2022-04-28 15:01:34,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {2100#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2100#true} is VALID [2022-04-28 15:01:34,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {2100#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2100#true} is VALID [2022-04-28 15:01:34,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {2100#true} assume !(0 != ~p1~0); {2100#true} is VALID [2022-04-28 15:01:34,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {2100#true} assume 0 != ~p2~0;~lk2~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:34,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:34,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:34,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:34,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:34,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:34,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:34,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {2105#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:34,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2105#(= main_~lk2~0 1)} is VALID [2022-04-28 15:01:34,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {2105#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2101#false} is VALID [2022-04-28 15:01:34,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#false} assume !false; {2101#false} is VALID [2022-04-28 15:01:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:34,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:34,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737677131] [2022-04-28 15:01:34,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737677131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:34,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:34,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:34,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:34,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1544807651] [2022-04-28 15:01:34,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1544807651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:34,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:34,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:34,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622609472] [2022-04-28 15:01:34,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:34,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:34,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:34,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:34,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:34,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:34,557 INFO L87 Difference]: Start difference. First operand 111 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,702 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2022-04-28 15:01:34,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:34,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 15:01:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 15:01:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-28 15:01:34,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-28 15:01:34,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:34,797 INFO L225 Difference]: With dead ends: 143 [2022-04-28 15:01:34,797 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 15:01:34,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:34,798 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:34,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 104 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 15:01:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-04-28 15:01:34,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:34,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,812 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,812 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,816 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-28 15:01:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-28 15:01:34,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:34,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:34,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-28 15:01:34,818 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-28 15:01:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:34,822 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-28 15:01:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-28 15:01:34,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:34,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:34,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:34,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-28 15:01:34,827 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-28 15:01:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:34,827 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-28 15:01:34,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:34,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 187 transitions. [2022-04-28 15:01:35,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-28 15:01:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 15:01:35,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:35,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:35,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:01:35,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:35,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:35,011 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 1 times [2022-04-28 15:01:35,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:35,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122469871] [2022-04-28 15:01:35,012 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 2 times [2022-04-28 15:01:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:35,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294619152] [2022-04-28 15:01:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:35,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:35,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:35,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {2908#(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(15, 2);call #Ultimate.allocInit(12, 3); {2902#true} is VALID [2022-04-28 15:01:35,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-28 15:01:35,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-28 15:01:35,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:35,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {2908#(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(15, 2);call #Ultimate.allocInit(12, 3); {2902#true} is VALID [2022-04-28 15:01:35,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-28 15:01:35,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-28 15:01:35,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret13 := main(); {2902#true} is VALID [2022-04-28 15:01:35,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {2902#true} is VALID [2022-04-28 15:01:35,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {2902#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2902#true} is VALID [2022-04-28 15:01:35,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {2902#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2902#true} is VALID [2022-04-28 15:01:35,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {2902#true} assume !(0 != ~p1~0); {2902#true} is VALID [2022-04-28 15:01:35,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {2902#true} assume !(0 != ~p2~0); {2902#true} is VALID [2022-04-28 15:01:35,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {2902#true} assume 0 != ~p3~0;~lk3~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:35,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:35,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:35,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:35,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:35,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:35,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:35,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:35,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2907#(= main_~lk3~0 1)} is VALID [2022-04-28 15:01:35,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {2907#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2903#false} is VALID [2022-04-28 15:01:35,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-28 15:01:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:35,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:35,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294619152] [2022-04-28 15:01:35,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294619152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:35,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:35,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:35,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:35,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122469871] [2022-04-28 15:01:35,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122469871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:35,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:35,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474738130] [2022-04-28 15:01:35,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:35,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:35,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:35,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:35,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:35,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:35,074 INFO L87 Difference]: Start difference. First operand 111 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:35,217 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2022-04-28 15:01:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:35,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 15:01:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-28 15:01:35,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-28 15:01:35,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:35,314 INFO L225 Difference]: With dead ends: 203 [2022-04-28 15:01:35,314 INFO L226 Difference]: Without dead ends: 201 [2022-04-28 15:01:35,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:35,316 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:35,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-28 15:01:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2022-04-28 15:01:35,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:35,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,336 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,336 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:35,342 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-28 15:01:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-28 15:01:35,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:35,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:35,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-28 15:01:35,344 INFO L87 Difference]: Start difference. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-28 15:01:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:35,350 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-28 15:01:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-28 15:01:35,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:35,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:35,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:35,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2022-04-28 15:01:35,365 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 253 transitions. Word has length 21 [2022-04-28 15:01:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:35,365 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-04-28 15:01:35,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 253 transitions. [2022-04-28 15:01:35,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 253 transitions. [2022-04-28 15:01:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 15:01:35,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:35,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:35,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:01:35,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:35,617 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 1 times [2022-04-28 15:01:35,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:35,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213898569] [2022-04-28 15:01:35,618 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 2 times [2022-04-28 15:01:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:35,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408630056] [2022-04-28 15:01:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:35,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:35,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {4030#(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(15, 2);call #Ultimate.allocInit(12, 3); {4024#true} is VALID [2022-04-28 15:01:35,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-28 15:01:35,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-28 15:01:35,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {4024#true} call ULTIMATE.init(); {4030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:35,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {4030#(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(15, 2);call #Ultimate.allocInit(12, 3); {4024#true} is VALID [2022-04-28 15:01:35,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-28 15:01:35,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-28 15:01:35,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {4024#true} call #t~ret13 := main(); {4024#true} is VALID [2022-04-28 15:01:35,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {4024#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {4024#true} is VALID [2022-04-28 15:01:35,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {4024#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {4024#true} is VALID [2022-04-28 15:01:35,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {4024#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {4024#true} is VALID [2022-04-28 15:01:35,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {4024#true} assume !(0 != ~p1~0); {4024#true} is VALID [2022-04-28 15:01:35,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {4024#true} assume !(0 != ~p2~0); {4024#true} is VALID [2022-04-28 15:01:35,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {4024#true} assume !(0 != ~p3~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:35,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:35,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:35,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:35,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:35,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:35,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:35,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-28 15:01:35,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p3~0; {4025#false} is VALID [2022-04-28 15:01:35,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {4025#false} assume 1 != ~lk3~0; {4025#false} is VALID [2022-04-28 15:01:35,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {4025#false} assume !false; {4025#false} is VALID [2022-04-28 15:01:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:35,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:35,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408630056] [2022-04-28 15:01:35,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408630056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:35,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:35,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:35,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:35,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213898569] [2022-04-28 15:01:35,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213898569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:35,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:35,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:35,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519965968] [2022-04-28 15:01:35,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:35,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:35,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:35,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:35,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:35,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:35,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:35,689 INFO L87 Difference]: Start difference. First operand 151 states and 253 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:35,840 INFO L93 Difference]: Finished difference Result 351 states and 595 transitions. [2022-04-28 15:01:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:35,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 15:01:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-28 15:01:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-28 15:01:35,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-28 15:01:35,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:35,980 INFO L225 Difference]: With dead ends: 351 [2022-04-28 15:01:35,980 INFO L226 Difference]: Without dead ends: 209 [2022-04-28 15:01:35,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:35,985 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:35,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-28 15:01:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-04-28 15:01:36,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:36,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,004 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,004 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:36,009 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-28 15:01:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-28 15:01:36,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:36,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:36,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 209 states. [2022-04-28 15:01:36,011 INFO L87 Difference]: Start difference. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 209 states. [2022-04-28 15:01:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:36,016 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-28 15:01:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-28 15:01:36,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:36,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:36,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:36,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2022-04-28 15:01:36,022 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 21 [2022-04-28 15:01:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:36,023 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2022-04-28 15:01:36,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 343 transitions. [2022-04-28 15:01:36,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2022-04-28 15:01:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 15:01:36,403 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:36,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:36,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:01:36,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:36,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 1 times [2022-04-28 15:01:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:36,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2091007266] [2022-04-28 15:01:36,404 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 2 times [2022-04-28 15:01:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:36,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689535514] [2022-04-28 15:01:36,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:36,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:36,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {5576#(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(15, 2);call #Ultimate.allocInit(12, 3); {5570#true} is VALID [2022-04-28 15:01:36,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-28 15:01:36,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-28 15:01:36,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {5570#true} call ULTIMATE.init(); {5576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:36,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {5576#(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(15, 2);call #Ultimate.allocInit(12, 3); {5570#true} is VALID [2022-04-28 15:01:36,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-28 15:01:36,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-28 15:01:36,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {5570#true} call #t~ret13 := main(); {5570#true} is VALID [2022-04-28 15:01:36,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {5570#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {5570#true} is VALID [2022-04-28 15:01:36,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {5570#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {5570#true} is VALID [2022-04-28 15:01:36,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {5570#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {5570#true} is VALID [2022-04-28 15:01:36,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {5570#true} assume !(0 != ~p1~0); {5570#true} is VALID [2022-04-28 15:01:36,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {5570#true} assume !(0 != ~p2~0); {5570#true} is VALID [2022-04-28 15:01:36,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {5570#true} assume 0 != ~p3~0;~lk3~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:36,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:36,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:36,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:36,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:36,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:36,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:36,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5575#(not (= main_~p3~0 0))} is VALID [2022-04-28 15:01:36,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5571#false} is VALID [2022-04-28 15:01:36,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {5571#false} assume 0 != ~p4~0; {5571#false} is VALID [2022-04-28 15:01:36,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {5571#false} assume 1 != ~lk4~0; {5571#false} is VALID [2022-04-28 15:01:36,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#false} assume !false; {5571#false} is VALID [2022-04-28 15:01:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:36,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:36,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689535514] [2022-04-28 15:01:36,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689535514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:36,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:36,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:36,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:36,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2091007266] [2022-04-28 15:01:36,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2091007266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:36,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:36,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:36,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098088856] [2022-04-28 15:01:36,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:36,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:36,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:36,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:36,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:36,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:36,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:36,470 INFO L87 Difference]: Start difference. First operand 207 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:36,630 INFO L93 Difference]: Finished difference Result 313 states and 517 transitions. [2022-04-28 15:01:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:36,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-28 15:01:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-28 15:01:36,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-28 15:01:36,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:36,743 INFO L225 Difference]: With dead ends: 313 [2022-04-28 15:01:36,743 INFO L226 Difference]: Without dead ends: 215 [2022-04-28 15:01:36,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:36,744 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:36,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-28 15:01:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-28 15:01:36,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:36,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,762 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,763 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:36,768 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-28 15:01:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-28 15:01:36,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:36,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:36,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-28 15:01:36,770 INFO L87 Difference]: Start difference. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-28 15:01:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:36,774 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-28 15:01:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-28 15:01:36,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:36,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:36,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:36,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 347 transitions. [2022-04-28 15:01:36,781 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 347 transitions. Word has length 22 [2022-04-28 15:01:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:36,781 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 347 transitions. [2022-04-28 15:01:36,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:36,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 347 transitions. [2022-04-28 15:01:37,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 347 transitions. [2022-04-28 15:01:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 15:01:37,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:37,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:37,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:01:37,098 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 1 times [2022-04-28 15:01:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:37,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649316887] [2022-04-28 15:01:37,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:37,099 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 2 times [2022-04-28 15:01:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:37,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682886150] [2022-04-28 15:01:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:37,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:37,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {7070#(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(15, 2);call #Ultimate.allocInit(12, 3); {7064#true} is VALID [2022-04-28 15:01:37,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-28 15:01:37,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-28 15:01:37,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {7064#true} call ULTIMATE.init(); {7070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:37,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {7070#(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(15, 2);call #Ultimate.allocInit(12, 3); {7064#true} is VALID [2022-04-28 15:01:37,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-28 15:01:37,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-28 15:01:37,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {7064#true} call #t~ret13 := main(); {7064#true} is VALID [2022-04-28 15:01:37,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {7064#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {7064#true} is VALID [2022-04-28 15:01:37,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {7064#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {7064#true} is VALID [2022-04-28 15:01:37,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {7064#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {7064#true} is VALID [2022-04-28 15:01:37,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {7064#true} assume !(0 != ~p1~0); {7064#true} is VALID [2022-04-28 15:01:37,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {7064#true} assume !(0 != ~p2~0); {7064#true} is VALID [2022-04-28 15:01:37,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {7064#true} assume !(0 != ~p3~0); {7064#true} is VALID [2022-04-28 15:01:37,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {7064#true} assume 0 != ~p4~0;~lk4~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:37,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:37,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:37,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:37,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:37,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:37,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:37,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:37,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7069#(= main_~lk4~0 1)} is VALID [2022-04-28 15:01:37,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {7069#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7065#false} is VALID [2022-04-28 15:01:37,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {7065#false} assume !false; {7065#false} is VALID [2022-04-28 15:01:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:37,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682886150] [2022-04-28 15:01:37,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682886150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:37,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:37,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:37,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:37,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649316887] [2022-04-28 15:01:37,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649316887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:37,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:37,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104530614] [2022-04-28 15:01:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:37,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:37,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:37,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:37,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:37,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:37,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:37,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:37,157 INFO L87 Difference]: Start difference. First operand 213 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:37,361 INFO L93 Difference]: Finished difference Result 381 states and 629 transitions. [2022-04-28 15:01:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:37,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 15:01:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-28 15:01:37,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-28 15:01:37,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:37,454 INFO L225 Difference]: With dead ends: 381 [2022-04-28 15:01:37,455 INFO L226 Difference]: Without dead ends: 379 [2022-04-28 15:01:37,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:37,456 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:37,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-28 15:01:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-28 15:01:37,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:37,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,484 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,484 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:37,494 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-28 15:01:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-28 15:01:37,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:37,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:37,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-28 15:01:37,496 INFO L87 Difference]: Start difference. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-28 15:01:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:37,505 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-28 15:01:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-28 15:01:37,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:37,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:37,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:37,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 475 transitions. [2022-04-28 15:01:37,514 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 475 transitions. Word has length 22 [2022-04-28 15:01:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:37,514 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 475 transitions. [2022-04-28 15:01:37,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:37,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 297 states and 475 transitions. [2022-04-28 15:01:37,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 475 transitions. [2022-04-28 15:01:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 15:01:37,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:37,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:37,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:01:37,992 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 1 times [2022-04-28 15:01:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:37,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [557300277] [2022-04-28 15:01:37,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:37,993 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 2 times [2022-04-28 15:01:37,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:37,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457113210] [2022-04-28 15:01:37,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:38,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:38,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {9196#(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(15, 2);call #Ultimate.allocInit(12, 3); {9190#true} is VALID [2022-04-28 15:01:38,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-28 15:01:38,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-28 15:01:38,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {9190#true} call ULTIMATE.init(); {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:38,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {9196#(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(15, 2);call #Ultimate.allocInit(12, 3); {9190#true} is VALID [2022-04-28 15:01:38,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-28 15:01:38,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-28 15:01:38,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {9190#true} call #t~ret13 := main(); {9190#true} is VALID [2022-04-28 15:01:38,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {9190#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {9190#true} is VALID [2022-04-28 15:01:38,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {9190#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {9190#true} is VALID [2022-04-28 15:01:38,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {9190#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {9190#true} is VALID [2022-04-28 15:01:38,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {9190#true} assume !(0 != ~p1~0); {9190#true} is VALID [2022-04-28 15:01:38,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {9190#true} assume !(0 != ~p2~0); {9190#true} is VALID [2022-04-28 15:01:38,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#true} assume !(0 != ~p3~0); {9190#true} is VALID [2022-04-28 15:01:38,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {9190#true} assume !(0 != ~p4~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:38,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:38,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:38,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:38,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:38,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p1~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:38,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p2~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:38,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p3~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-28 15:01:38,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p4~0; {9191#false} is VALID [2022-04-28 15:01:38,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#false} assume 1 != ~lk4~0; {9191#false} is VALID [2022-04-28 15:01:38,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#false} assume !false; {9191#false} is VALID [2022-04-28 15:01:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:38,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457113210] [2022-04-28 15:01:38,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457113210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:38,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:38,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:38,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:38,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [557300277] [2022-04-28 15:01:38,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [557300277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:38,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:38,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675451718] [2022-04-28 15:01:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:38,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:38,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:38,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:38,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:38,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:38,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:38,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:38,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:38,077 INFO L87 Difference]: Start difference. First operand 297 states and 475 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:38,285 INFO L93 Difference]: Finished difference Result 685 states and 1101 transitions. [2022-04-28 15:01:38,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:38,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 15:01:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:38,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 15:01:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 15:01:38,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-28 15:01:38,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:38,411 INFO L225 Difference]: With dead ends: 685 [2022-04-28 15:01:38,411 INFO L226 Difference]: Without dead ends: 403 [2022-04-28 15:01:38,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:38,414 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:38,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-28 15:01:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-28 15:01:38,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:38,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:38,444 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:38,446 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:38,456 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-28 15:01:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-28 15:01:38,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:38,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:38,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-28 15:01:38,458 INFO L87 Difference]: Start difference. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-28 15:01:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:38,469 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-28 15:01:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-28 15:01:38,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:38,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:38,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:38,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2022-04-28 15:01:38,483 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 22 [2022-04-28 15:01:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:38,483 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2022-04-28 15:01:38,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:38,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 631 transitions. [2022-04-28 15:01:39,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2022-04-28 15:01:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 15:01:39,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:39,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:39,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:01:39,099 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 1 times [2022-04-28 15:01:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:39,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1487794242] [2022-04-28 15:01:39,100 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 2 times [2022-04-28 15:01:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:39,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387629962] [2022-04-28 15:01:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:39,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {12186#(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(15, 2);call #Ultimate.allocInit(12, 3); {12180#true} is VALID [2022-04-28 15:01:39,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-28 15:01:39,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-28 15:01:39,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {12180#true} call ULTIMATE.init(); {12186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:39,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {12186#(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(15, 2);call #Ultimate.allocInit(12, 3); {12180#true} is VALID [2022-04-28 15:01:39,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-28 15:01:39,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-28 15:01:39,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {12180#true} call #t~ret13 := main(); {12180#true} is VALID [2022-04-28 15:01:39,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {12180#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {12180#true} is VALID [2022-04-28 15:01:39,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {12180#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {12180#true} is VALID [2022-04-28 15:01:39,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {12180#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {12180#true} is VALID [2022-04-28 15:01:39,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {12180#true} assume !(0 != ~p1~0); {12180#true} is VALID [2022-04-28 15:01:39,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {12180#true} assume !(0 != ~p2~0); {12180#true} is VALID [2022-04-28 15:01:39,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {12180#true} assume !(0 != ~p3~0); {12180#true} is VALID [2022-04-28 15:01:39,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {12180#true} assume 0 != ~p4~0;~lk4~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:39,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:39,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:39,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:39,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:39,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:39,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:39,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-28 15:01:39,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {12181#false} is VALID [2022-04-28 15:01:39,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {12181#false} assume 0 != ~p5~0; {12181#false} is VALID [2022-04-28 15:01:39,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {12181#false} assume 1 != ~lk5~0; {12181#false} is VALID [2022-04-28 15:01:39,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {12181#false} assume !false; {12181#false} is VALID [2022-04-28 15:01:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:39,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387629962] [2022-04-28 15:01:39,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387629962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:39,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:39,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:39,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:39,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1487794242] [2022-04-28 15:01:39,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1487794242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:39,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:39,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652527998] [2022-04-28 15:01:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:39,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 15:01:39,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:39,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:39,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:39,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:39,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:39,203 INFO L87 Difference]: Start difference. First operand 401 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:39,371 INFO L93 Difference]: Finished difference Result 601 states and 941 transitions. [2022-04-28 15:01:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:39,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 15:01:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-28 15:01:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-28 15:01:39,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-28 15:01:39,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:39,484 INFO L225 Difference]: With dead ends: 601 [2022-04-28 15:01:39,484 INFO L226 Difference]: Without dead ends: 411 [2022-04-28 15:01:39,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:39,485 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:39,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-28 15:01:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-28 15:01:39,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:39,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:39,518 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:39,519 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:39,529 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-28 15:01:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-28 15:01:39,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:39,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:39,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-28 15:01:39,532 INFO L87 Difference]: Start difference. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-28 15:01:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:39,542 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-28 15:01:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-28 15:01:39,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:39,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:39,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:39,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 631 transitions. [2022-04-28 15:01:39,556 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 631 transitions. Word has length 23 [2022-04-28 15:01:39,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:39,556 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 631 transitions. [2022-04-28 15:01:39,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:39,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 409 states and 631 transitions. [2022-04-28 15:01:40,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2022-04-28 15:01:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 15:01:40,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:40,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:40,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:01:40,189 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:40,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 1 times [2022-04-28 15:01:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:40,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612656018] [2022-04-28 15:01:40,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 2 times [2022-04-28 15:01:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:40,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018755122] [2022-04-28 15:01:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:40,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {15040#(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(15, 2);call #Ultimate.allocInit(12, 3); {15034#true} is VALID [2022-04-28 15:01:40,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-28 15:01:40,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-28 15:01:40,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {15034#true} call ULTIMATE.init(); {15040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:40,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {15040#(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(15, 2);call #Ultimate.allocInit(12, 3); {15034#true} is VALID [2022-04-28 15:01:40,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-28 15:01:40,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-28 15:01:40,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {15034#true} call #t~ret13 := main(); {15034#true} is VALID [2022-04-28 15:01:40,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {15034#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {15034#true} is VALID [2022-04-28 15:01:40,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {15034#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {15034#true} is VALID [2022-04-28 15:01:40,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {15034#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {15034#true} is VALID [2022-04-28 15:01:40,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {15034#true} assume !(0 != ~p1~0); {15034#true} is VALID [2022-04-28 15:01:40,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {15034#true} assume !(0 != ~p2~0); {15034#true} is VALID [2022-04-28 15:01:40,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {15034#true} assume !(0 != ~p3~0); {15034#true} is VALID [2022-04-28 15:01:40,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {15034#true} assume !(0 != ~p4~0); {15034#true} is VALID [2022-04-28 15:01:40,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {15034#true} assume 0 != ~p5~0;~lk5~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:40,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:40,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:40,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:40,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:40,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:40,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:40,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:40,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p5~0; {15039#(= main_~lk5~0 1)} is VALID [2022-04-28 15:01:40,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {15039#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {15035#false} is VALID [2022-04-28 15:01:40,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {15035#false} assume !false; {15035#false} is VALID [2022-04-28 15:01:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:40,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:40,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018755122] [2022-04-28 15:01:40,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018755122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:40,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:40,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:40,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:40,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612656018] [2022-04-28 15:01:40,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612656018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:40,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:40,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:40,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244758992] [2022-04-28 15:01:40,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:40,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 15:01:40,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:40,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:40,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:40,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:40,268 INFO L87 Difference]: Start difference. First operand 409 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:40,463 INFO L93 Difference]: Finished difference Result 717 states and 1121 transitions. [2022-04-28 15:01:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:40,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 15:01:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 15:01:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-28 15:01:40,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-28 15:01:40,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:40,577 INFO L225 Difference]: With dead ends: 717 [2022-04-28 15:01:40,577 INFO L226 Difference]: Without dead ends: 715 [2022-04-28 15:01:40,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:40,578 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:40,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-28 15:01:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-28 15:01:40,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:40,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:40,627 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:40,628 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:40,674 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-28 15:01:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-28 15:01:40,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:40,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:40,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-28 15:01:40,677 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 715 states. [2022-04-28 15:01:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:40,701 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-28 15:01:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-28 15:01:40,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:40,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:40,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:40,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 879 transitions. [2022-04-28 15:01:40,726 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 879 transitions. Word has length 23 [2022-04-28 15:01:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:40,727 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 879 transitions. [2022-04-28 15:01:40,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:40,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 879 transitions. [2022-04-28 15:01:41,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 879 transitions. [2022-04-28 15:01:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 15:01:41,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:41,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:41,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:01:41,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 1 times [2022-04-28 15:01:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197672570] [2022-04-28 15:01:41,561 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 2 times [2022-04-28 15:01:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232729060] [2022-04-28 15:01:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:41,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:41,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {19086#(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(15, 2);call #Ultimate.allocInit(12, 3); {19080#true} is VALID [2022-04-28 15:01:41,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-28 15:01:41,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-28 15:01:41,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {19080#true} call ULTIMATE.init(); {19086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:41,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {19086#(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(15, 2);call #Ultimate.allocInit(12, 3); {19080#true} is VALID [2022-04-28 15:01:41,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-28 15:01:41,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-28 15:01:41,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {19080#true} call #t~ret13 := main(); {19080#true} is VALID [2022-04-28 15:01:41,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {19080#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {19080#true} is VALID [2022-04-28 15:01:41,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {19080#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {19080#true} is VALID [2022-04-28 15:01:41,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {19080#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {19080#true} is VALID [2022-04-28 15:01:41,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {19080#true} assume !(0 != ~p1~0); {19080#true} is VALID [2022-04-28 15:01:41,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {19080#true} assume !(0 != ~p2~0); {19080#true} is VALID [2022-04-28 15:01:41,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {19080#true} assume !(0 != ~p3~0); {19080#true} is VALID [2022-04-28 15:01:41,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {19080#true} assume !(0 != ~p4~0); {19080#true} is VALID [2022-04-28 15:01:41,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {19080#true} assume !(0 != ~p5~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:41,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:41,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:41,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:41,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p1~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:41,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p2~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:41,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p3~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:41,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p4~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-28 15:01:41,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p5~0; {19081#false} is VALID [2022-04-28 15:01:41,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {19081#false} assume 1 != ~lk5~0; {19081#false} is VALID [2022-04-28 15:01:41,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {19081#false} assume !false; {19081#false} is VALID [2022-04-28 15:01:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:41,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:41,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232729060] [2022-04-28 15:01:41,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232729060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:41,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:41,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:41,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:41,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197672570] [2022-04-28 15:01:41,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197672570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:41,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:41,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955146472] [2022-04-28 15:01:41,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 15:01:41,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:41,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:41,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:41,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:41,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:41,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:41,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:41,644 INFO L87 Difference]: Start difference. First operand 585 states and 879 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:41,932 INFO L93 Difference]: Finished difference Result 1341 states and 2017 transitions. [2022-04-28 15:01:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:41,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 15:01:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-28 15:01:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-28 15:01:41,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-28 15:01:42,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:42,082 INFO L225 Difference]: With dead ends: 1341 [2022-04-28 15:01:42,082 INFO L226 Difference]: Without dead ends: 779 [2022-04-28 15:01:42,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:42,084 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:42,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-28 15:01:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-28 15:01:42,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:42,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:42,185 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:42,186 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:42,216 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-28 15:01:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-28 15:01:42,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:42,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:42,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 779 states. [2022-04-28 15:01:42,220 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 779 states. [2022-04-28 15:01:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:42,249 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-28 15:01:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-28 15:01:42,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:42,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:42,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:42,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1143 transitions. [2022-04-28 15:01:42,300 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1143 transitions. Word has length 23 [2022-04-28 15:01:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:42,300 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1143 transitions. [2022-04-28 15:01:42,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:42,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1143 transitions. [2022-04-28 15:01:43,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1143 edges. 1143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1143 transitions. [2022-04-28 15:01:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 15:01:43,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:43,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:43,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:01:43,372 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 1 times [2022-04-28 15:01:43,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:43,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101392830] [2022-04-28 15:01:43,373 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 2 times [2022-04-28 15:01:43,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:43,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549429950] [2022-04-28 15:01:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:43,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:43,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {24892#(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(15, 2);call #Ultimate.allocInit(12, 3); {24886#true} is VALID [2022-04-28 15:01:43,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-28 15:01:43,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-28 15:01:43,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {24886#true} call ULTIMATE.init(); {24892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:43,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {24892#(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(15, 2);call #Ultimate.allocInit(12, 3); {24886#true} is VALID [2022-04-28 15:01:43,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-28 15:01:43,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-28 15:01:43,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {24886#true} call #t~ret13 := main(); {24886#true} is VALID [2022-04-28 15:01:43,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {24886#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {24886#true} is VALID [2022-04-28 15:01:43,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {24886#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {24886#true} is VALID [2022-04-28 15:01:43,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {24886#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {24886#true} is VALID [2022-04-28 15:01:43,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {24886#true} assume !(0 != ~p1~0); {24886#true} is VALID [2022-04-28 15:01:43,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {24886#true} assume !(0 != ~p2~0); {24886#true} is VALID [2022-04-28 15:01:43,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {24886#true} assume !(0 != ~p3~0); {24886#true} is VALID [2022-04-28 15:01:43,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {24886#true} assume !(0 != ~p4~0); {24886#true} is VALID [2022-04-28 15:01:43,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {24886#true} assume 0 != ~p5~0;~lk5~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:43,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:43,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:43,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:43,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:43,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:43,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:43,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-28 15:01:43,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {24887#false} is VALID [2022-04-28 15:01:43,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {24887#false} assume 0 != ~p6~0; {24887#false} is VALID [2022-04-28 15:01:43,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {24887#false} assume 1 != ~lk6~0; {24887#false} is VALID [2022-04-28 15:01:43,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {24887#false} assume !false; {24887#false} is VALID [2022-04-28 15:01:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:43,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:43,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549429950] [2022-04-28 15:01:43,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549429950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:43,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:43,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:43,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:43,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101392830] [2022-04-28 15:01:43,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101392830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:43,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:43,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:43,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131751068] [2022-04-28 15:01:43,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:43,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 15:01:43,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:43,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:43,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:43,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:43,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:43,427 INFO L87 Difference]: Start difference. First operand 777 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:43,695 INFO L93 Difference]: Finished difference Result 1165 states and 1705 transitions. [2022-04-28 15:01:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 15:01:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 15:01:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 15:01:43,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-28 15:01:43,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:43,876 INFO L225 Difference]: With dead ends: 1165 [2022-04-28 15:01:43,877 INFO L226 Difference]: Without dead ends: 795 [2022-04-28 15:01:43,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:43,878 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:43,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-28 15:01:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-28 15:01:43,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:43,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:43,944 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:43,945 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:43,979 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-28 15:01:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-28 15:01:43,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:43,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:43,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 795 states. [2022-04-28 15:01:43,982 INFO L87 Difference]: Start difference. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 795 states. [2022-04-28 15:01:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:44,013 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-28 15:01:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-28 15:01:44,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:44,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:44,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:44,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1143 transitions. [2022-04-28 15:01:44,060 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1143 transitions. Word has length 24 [2022-04-28 15:01:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:44,060 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1143 transitions. [2022-04-28 15:01:44,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:44,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 793 states and 1143 transitions. [2022-04-28 15:01:45,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1143 edges. 1143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1143 transitions. [2022-04-28 15:01:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 15:01:45,151 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:45,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:45,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:01:45,151 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 1 times [2022-04-28 15:01:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:45,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1651467258] [2022-04-28 15:01:45,152 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 2 times [2022-04-28 15:01:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:45,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375433914] [2022-04-28 15:01:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:45,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:45,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {30410#(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(15, 2);call #Ultimate.allocInit(12, 3); {30404#true} is VALID [2022-04-28 15:01:45,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-28 15:01:45,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-28 15:01:45,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {30404#true} call ULTIMATE.init(); {30410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:45,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {30410#(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(15, 2);call #Ultimate.allocInit(12, 3); {30404#true} is VALID [2022-04-28 15:01:45,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-28 15:01:45,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-28 15:01:45,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {30404#true} call #t~ret13 := main(); {30404#true} is VALID [2022-04-28 15:01:45,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {30404#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {30404#true} is VALID [2022-04-28 15:01:45,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {30404#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {30404#true} is VALID [2022-04-28 15:01:45,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {30404#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {30404#true} is VALID [2022-04-28 15:01:45,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {30404#true} assume !(0 != ~p1~0); {30404#true} is VALID [2022-04-28 15:01:45,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {30404#true} assume !(0 != ~p2~0); {30404#true} is VALID [2022-04-28 15:01:45,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {30404#true} assume !(0 != ~p3~0); {30404#true} is VALID [2022-04-28 15:01:45,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {30404#true} assume !(0 != ~p4~0); {30404#true} is VALID [2022-04-28 15:01:45,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {30404#true} assume !(0 != ~p5~0); {30404#true} is VALID [2022-04-28 15:01:45,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {30404#true} assume 0 != ~p6~0;~lk6~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:45,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:45,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:45,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:45,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:45,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:45,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:45,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:45,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p6~0; {30409#(= main_~lk6~0 1)} is VALID [2022-04-28 15:01:45,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {30409#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {30405#false} is VALID [2022-04-28 15:01:45,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {30405#false} assume !false; {30405#false} is VALID [2022-04-28 15:01:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:45,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375433914] [2022-04-28 15:01:45,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375433914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:45,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:45,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:45,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:45,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1651467258] [2022-04-28 15:01:45,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1651467258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:45,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:45,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144222914] [2022-04-28 15:01:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:45,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 15:01:45,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:45,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:45,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:45,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:45,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:45,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:45,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:45,221 INFO L87 Difference]: Start difference. First operand 793 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:45,549 INFO L93 Difference]: Finished difference Result 1357 states and 1977 transitions. [2022-04-28 15:01:45,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:45,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 15:01:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 15:01:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 15:01:45,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-28 15:01:45,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:45,747 INFO L225 Difference]: With dead ends: 1357 [2022-04-28 15:01:45,747 INFO L226 Difference]: Without dead ends: 1355 [2022-04-28 15:01:45,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:45,751 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:45,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-28 15:01:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-28 15:01:45,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:45,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:45,858 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:45,859 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:45,930 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-28 15:01:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-28 15:01:45,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:45,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:45,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-28 15:01:45,937 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-28 15:01:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:46,008 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-28 15:01:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-28 15:01:46,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:46,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:46,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:46,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1623 transitions. [2022-04-28 15:01:46,131 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1623 transitions. Word has length 24 [2022-04-28 15:01:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:46,131 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1623 transitions. [2022-04-28 15:01:46,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:46,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1623 transitions. [2022-04-28 15:01:47,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1623 edges. 1623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1623 transitions. [2022-04-28 15:01:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 15:01:47,681 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:47,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:47,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:01:47,682 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:47,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 1 times [2022-04-28 15:01:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:47,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039108574] [2022-04-28 15:01:47,682 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:47,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 2 times [2022-04-28 15:01:47,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:47,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573014184] [2022-04-28 15:01:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:47,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:47,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {38168#(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(15, 2);call #Ultimate.allocInit(12, 3); {38162#true} is VALID [2022-04-28 15:01:47,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-28 15:01:47,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-28 15:01:47,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {38162#true} call ULTIMATE.init(); {38168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:47,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {38168#(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(15, 2);call #Ultimate.allocInit(12, 3); {38162#true} is VALID [2022-04-28 15:01:47,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-28 15:01:47,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-28 15:01:47,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {38162#true} call #t~ret13 := main(); {38162#true} is VALID [2022-04-28 15:01:47,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {38162#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {38162#true} is VALID [2022-04-28 15:01:47,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {38162#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {38162#true} is VALID [2022-04-28 15:01:47,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {38162#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {38162#true} is VALID [2022-04-28 15:01:47,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {38162#true} assume !(0 != ~p1~0); {38162#true} is VALID [2022-04-28 15:01:47,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {38162#true} assume !(0 != ~p2~0); {38162#true} is VALID [2022-04-28 15:01:47,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {38162#true} assume !(0 != ~p3~0); {38162#true} is VALID [2022-04-28 15:01:47,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {38162#true} assume !(0 != ~p4~0); {38162#true} is VALID [2022-04-28 15:01:47,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {38162#true} assume !(0 != ~p5~0); {38162#true} is VALID [2022-04-28 15:01:47,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {38162#true} assume !(0 != ~p6~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:47,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {38167#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:47,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {38167#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:47,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p1~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:47,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p2~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:47,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p3~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:47,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p4~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:47,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p5~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-28 15:01:47,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p6~0; {38163#false} is VALID [2022-04-28 15:01:47,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {38163#false} assume 1 != ~lk6~0; {38163#false} is VALID [2022-04-28 15:01:47,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {38163#false} assume !false; {38163#false} is VALID [2022-04-28 15:01:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:47,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573014184] [2022-04-28 15:01:47,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573014184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:47,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:47,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:47,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039108574] [2022-04-28 15:01:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039108574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:47,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:47,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838338196] [2022-04-28 15:01:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:47,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 15:01:47,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:47,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:47,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:47,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:47,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:47,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:47,736 INFO L87 Difference]: Start difference. First operand 1161 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:48,261 INFO L93 Difference]: Finished difference Result 2637 states and 3673 transitions. [2022-04-28 15:01:48,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:48,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 15:01:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 15:01:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-28 15:01:48,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-28 15:01:48,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:48,469 INFO L225 Difference]: With dead ends: 2637 [2022-04-28 15:01:48,469 INFO L226 Difference]: Without dead ends: 1515 [2022-04-28 15:01:48,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:48,471 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:48,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-28 15:01:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-28 15:01:48,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:48,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:48,607 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:48,609 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:48,670 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-28 15:01:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-28 15:01:48,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:48,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:48,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1515 states. [2022-04-28 15:01:48,678 INFO L87 Difference]: Start difference. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1515 states. [2022-04-28 15:01:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:48,763 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-28 15:01:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-28 15:01:48,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:48,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:48,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:48,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2055 transitions. [2022-04-28 15:01:48,866 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2055 transitions. Word has length 24 [2022-04-28 15:01:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:48,866 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 2055 transitions. [2022-04-28 15:01:48,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:48,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1513 states and 2055 transitions. [2022-04-28 15:01:50,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2055 edges. 2055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2055 transitions. [2022-04-28 15:01:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 15:01:50,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:50,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:50,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:01:50,812 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 1 times [2022-04-28 15:01:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:50,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1319733156] [2022-04-28 15:01:50,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 2 times [2022-04-28 15:01:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:50,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487991444] [2022-04-28 15:01:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:50,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {49510#(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(15, 2);call #Ultimate.allocInit(12, 3); {49504#true} is VALID [2022-04-28 15:01:50,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-28 15:01:50,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-28 15:01:50,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {49504#true} call ULTIMATE.init(); {49510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:50,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {49510#(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(15, 2);call #Ultimate.allocInit(12, 3); {49504#true} is VALID [2022-04-28 15:01:50,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-28 15:01:50,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-28 15:01:50,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {49504#true} call #t~ret13 := main(); {49504#true} is VALID [2022-04-28 15:01:50,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {49504#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {49504#true} is VALID [2022-04-28 15:01:50,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {49504#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {49504#true} is VALID [2022-04-28 15:01:50,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {49504#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {49504#true} is VALID [2022-04-28 15:01:50,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {49504#true} assume !(0 != ~p1~0); {49504#true} is VALID [2022-04-28 15:01:50,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {49504#true} assume !(0 != ~p2~0); {49504#true} is VALID [2022-04-28 15:01:50,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {49504#true} assume !(0 != ~p3~0); {49504#true} is VALID [2022-04-28 15:01:50,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {49504#true} assume !(0 != ~p4~0); {49504#true} is VALID [2022-04-28 15:01:50,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {49504#true} assume !(0 != ~p5~0); {49504#true} is VALID [2022-04-28 15:01:50,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {49504#true} assume 0 != ~p6~0;~lk6~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:01:50,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {49509#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:01:50,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {49509#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:01:50,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:01:50,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:01:50,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:01:50,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:01:50,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-28 15:01:50,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {49505#false} is VALID [2022-04-28 15:01:50,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {49505#false} assume 0 != ~p7~0; {49505#false} is VALID [2022-04-28 15:01:50,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {49505#false} assume 1 != ~lk7~0; {49505#false} is VALID [2022-04-28 15:01:50,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {49505#false} assume !false; {49505#false} is VALID [2022-04-28 15:01:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:50,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:50,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487991444] [2022-04-28 15:01:50,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487991444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:50,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:50,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:50,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:50,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1319733156] [2022-04-28 15:01:50,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1319733156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:50,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:50,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:50,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757084565] [2022-04-28 15:01:50,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:50,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 15:01:50,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:50,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:50,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:50,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:50,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:50,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:50,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:50,864 INFO L87 Difference]: Start difference. First operand 1513 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:51,316 INFO L93 Difference]: Finished difference Result 2269 states and 3065 transitions. [2022-04-28 15:01:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 15:01:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 15:01:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 15:01:51,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-28 15:01:51,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:51,504 INFO L225 Difference]: With dead ends: 2269 [2022-04-28 15:01:51,505 INFO L226 Difference]: Without dead ends: 1547 [2022-04-28 15:01:51,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:51,506 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:51,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-28 15:01:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-28 15:01:51,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:51,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,660 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,661 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:51,735 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-28 15:01:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-28 15:01:51,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:51,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:51,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-28 15:01:51,741 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1547 states. [2022-04-28 15:01:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:51,834 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-28 15:01:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-28 15:01:51,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:51,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:51,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:51,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2055 transitions. [2022-04-28 15:01:51,935 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2055 transitions. Word has length 25 [2022-04-28 15:01:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:51,935 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 2055 transitions. [2022-04-28 15:01:51,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:51,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2055 transitions. [2022-04-28 15:01:53,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2055 edges. 2055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2055 transitions. [2022-04-28 15:01:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 15:01:53,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:53,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:53,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:01:53,933 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:53,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 1 times [2022-04-28 15:01:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:53,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1253941957] [2022-04-28 15:01:53,934 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:53,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 2 times [2022-04-28 15:01:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:53,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010379786] [2022-04-28 15:01:53,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:53,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:53,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {60244#(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(15, 2);call #Ultimate.allocInit(12, 3); {60238#true} is VALID [2022-04-28 15:01:53,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-28 15:01:53,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-28 15:01:53,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {60238#true} call ULTIMATE.init(); {60244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:53,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {60244#(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(15, 2);call #Ultimate.allocInit(12, 3); {60238#true} is VALID [2022-04-28 15:01:53,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-28 15:01:53,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-28 15:01:53,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {60238#true} call #t~ret13 := main(); {60238#true} is VALID [2022-04-28 15:01:53,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {60238#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {60238#true} is VALID [2022-04-28 15:01:53,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {60238#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {60238#true} is VALID [2022-04-28 15:01:53,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {60238#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {60238#true} is VALID [2022-04-28 15:01:53,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {60238#true} assume !(0 != ~p1~0); {60238#true} is VALID [2022-04-28 15:01:53,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {60238#true} assume !(0 != ~p2~0); {60238#true} is VALID [2022-04-28 15:01:53,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {60238#true} assume !(0 != ~p3~0); {60238#true} is VALID [2022-04-28 15:01:53,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {60238#true} assume !(0 != ~p4~0); {60238#true} is VALID [2022-04-28 15:01:53,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {60238#true} assume !(0 != ~p5~0); {60238#true} is VALID [2022-04-28 15:01:53,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {60238#true} assume !(0 != ~p6~0); {60238#true} is VALID [2022-04-28 15:01:53,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {60238#true} assume 0 != ~p7~0;~lk7~0 := 1; {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:53,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {60243#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:53,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:53,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:53,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:53,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:53,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:53,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:53,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {60243#(= main_~lk7~0 1)} assume 0 != ~p7~0; {60243#(= main_~lk7~0 1)} is VALID [2022-04-28 15:01:53,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {60243#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {60239#false} is VALID [2022-04-28 15:01:53,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {60239#false} assume !false; {60239#false} is VALID [2022-04-28 15:01:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:53,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010379786] [2022-04-28 15:01:53,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010379786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:53,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:53,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:53,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:53,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1253941957] [2022-04-28 15:01:53,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1253941957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:53,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:53,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753894212] [2022-04-28 15:01:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:53,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 15:01:53,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:53,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:54,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:54,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:54,007 INFO L87 Difference]: Start difference. First operand 1545 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:54,566 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2022-04-28 15:01:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:54,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 15:01:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 15:01:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-28 15:01:54,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-28 15:01:54,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:54,880 INFO L225 Difference]: With dead ends: 2573 [2022-04-28 15:01:54,880 INFO L226 Difference]: Without dead ends: 2571 [2022-04-28 15:01:54,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:01:54,881 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:01:54,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:01:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-28 15:01:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-28 15:01:55,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:55,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:55,085 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:55,087 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:55,331 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-28 15:01:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-28 15:01:55,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:55,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:55,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2571 states. [2022-04-28 15:01:55,340 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2571 states. [2022-04-28 15:01:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:55,589 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-28 15:01:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-28 15:01:55,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:55,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:55,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:55,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2983 transitions. [2022-04-28 15:01:55,960 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2983 transitions. Word has length 25 [2022-04-28 15:01:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:55,960 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 2983 transitions. [2022-04-28 15:01:55,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:55,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 2983 transitions. [2022-04-28 15:01:59,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2983 edges. 2983 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2983 transitions. [2022-04-28 15:01:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 15:01:59,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:59,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:01:59,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:01:59,003 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:59,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 1 times [2022-04-28 15:01:59,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:59,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776918243] [2022-04-28 15:01:59,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 2 times [2022-04-28 15:01:59,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:59,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010877790] [2022-04-28 15:01:59,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:59,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:59,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {75170#(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(15, 2);call #Ultimate.allocInit(12, 3); {75164#true} is VALID [2022-04-28 15:01:59,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-28 15:01:59,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-28 15:01:59,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {75164#true} call ULTIMATE.init(); {75170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:01:59,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {75170#(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(15, 2);call #Ultimate.allocInit(12, 3); {75164#true} is VALID [2022-04-28 15:01:59,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-28 15:01:59,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-28 15:01:59,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {75164#true} call #t~ret13 := main(); {75164#true} is VALID [2022-04-28 15:01:59,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {75164#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {75164#true} is VALID [2022-04-28 15:01:59,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {75164#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {75164#true} is VALID [2022-04-28 15:01:59,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {75164#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {75164#true} is VALID [2022-04-28 15:01:59,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {75164#true} assume !(0 != ~p1~0); {75164#true} is VALID [2022-04-28 15:01:59,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {75164#true} assume !(0 != ~p2~0); {75164#true} is VALID [2022-04-28 15:01:59,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {75164#true} assume !(0 != ~p3~0); {75164#true} is VALID [2022-04-28 15:01:59,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {75164#true} assume !(0 != ~p4~0); {75164#true} is VALID [2022-04-28 15:01:59,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {75164#true} assume !(0 != ~p5~0); {75164#true} is VALID [2022-04-28 15:01:59,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {75164#true} assume !(0 != ~p6~0); {75164#true} is VALID [2022-04-28 15:01:59,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {75164#true} assume !(0 != ~p7~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:59,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {75169#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {75169#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:59,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p1~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:59,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p2~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:59,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p3~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:59,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p4~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:59,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p5~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:59,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p6~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-28 15:01:59,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {75169#(= main_~p7~0 0)} assume 0 != ~p7~0; {75165#false} is VALID [2022-04-28 15:01:59,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {75165#false} assume 1 != ~lk7~0; {75165#false} is VALID [2022-04-28 15:01:59,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {75165#false} assume !false; {75165#false} is VALID [2022-04-28 15:01:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:01:59,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:59,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010877790] [2022-04-28 15:01:59,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010877790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:59,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:59,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:59,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:59,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776918243] [2022-04-28 15:01:59,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776918243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:59,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:59,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:59,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854260362] [2022-04-28 15:01:59,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:59,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 15:01:59,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:59,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:01:59,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:01:59,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:59,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:59,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:59,085 INFO L87 Difference]: Start difference. First operand 2313 states and 2983 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:00,521 INFO L93 Difference]: Finished difference Result 5197 states and 6633 transitions. [2022-04-28 15:02:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 15:02:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 15:02:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-28 15:02:00,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-28 15:02:00,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:00,967 INFO L225 Difference]: With dead ends: 5197 [2022-04-28 15:02:00,967 INFO L226 Difference]: Without dead ends: 2955 [2022-04-28 15:02:00,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:02:00,970 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:00,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-28 15:02:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-28 15:02:01,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:01,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:01,238 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:01,240 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:01,483 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-28 15:02:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-28 15:02:01,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:01,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:01,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-28 15:02:01,490 INFO L87 Difference]: Start difference. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2955 states. [2022-04-28 15:02:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:01,716 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-28 15:02:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-28 15:02:01,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:01,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:01,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:01,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3655 transitions. [2022-04-28 15:02:02,098 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3655 transitions. Word has length 25 [2022-04-28 15:02:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:02,098 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 3655 transitions. [2022-04-28 15:02:02,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:02,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2953 states and 3655 transitions. [2022-04-28 15:02:05,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3655 edges. 3655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3655 transitions. [2022-04-28 15:02:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:02:05,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:05,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:02:05,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:02:05,668 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 1 times [2022-04-28 15:02:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:05,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [945352734] [2022-04-28 15:02:05,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 2 times [2022-04-28 15:02:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:05,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75060757] [2022-04-28 15:02:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:05,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:05,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {97392#(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(15, 2);call #Ultimate.allocInit(12, 3); {97386#true} is VALID [2022-04-28 15:02:05,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-28 15:02:05,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-28 15:02:05,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {97386#true} call ULTIMATE.init(); {97392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:05,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {97392#(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(15, 2);call #Ultimate.allocInit(12, 3); {97386#true} is VALID [2022-04-28 15:02:05,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-28 15:02:05,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-28 15:02:05,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {97386#true} call #t~ret13 := main(); {97386#true} is VALID [2022-04-28 15:02:05,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {97386#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {97386#true} is VALID [2022-04-28 15:02:05,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {97386#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {97386#true} is VALID [2022-04-28 15:02:05,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {97386#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {97386#true} is VALID [2022-04-28 15:02:05,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {97386#true} assume !(0 != ~p1~0); {97386#true} is VALID [2022-04-28 15:02:05,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {97386#true} assume !(0 != ~p2~0); {97386#true} is VALID [2022-04-28 15:02:05,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {97386#true} assume !(0 != ~p3~0); {97386#true} is VALID [2022-04-28 15:02:05,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {97386#true} assume !(0 != ~p4~0); {97386#true} is VALID [2022-04-28 15:02:05,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {97386#true} assume !(0 != ~p5~0); {97386#true} is VALID [2022-04-28 15:02:05,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {97386#true} assume !(0 != ~p6~0); {97386#true} is VALID [2022-04-28 15:02:05,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {97386#true} assume 0 != ~p7~0;~lk7~0 := 1; {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:05,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {97391#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:05,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:05,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:05,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:05,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:05,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:05,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-28 15:02:05,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {97387#false} is VALID [2022-04-28 15:02:05,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {97387#false} assume 0 != ~p8~0; {97387#false} is VALID [2022-04-28 15:02:05,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {97387#false} assume 1 != ~lk8~0; {97387#false} is VALID [2022-04-28 15:02:05,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {97387#false} assume !false; {97387#false} is VALID [2022-04-28 15:02:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:02:05,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:05,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75060757] [2022-04-28 15:02:05,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75060757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:05,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:05,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:05,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:05,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [945352734] [2022-04-28 15:02:05,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [945352734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:05,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:05,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:05,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18135147] [2022-04-28 15:02:05,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:05,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 15:02:05,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:05,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:05,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:05,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:05,738 INFO L87 Difference]: Start difference. First operand 2953 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:07,012 INFO L93 Difference]: Finished difference Result 4429 states and 5449 transitions. [2022-04-28 15:02:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:07,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 15:02:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 15:02:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 15:02:07,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-28 15:02:07,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:07,460 INFO L225 Difference]: With dead ends: 4429 [2022-04-28 15:02:07,460 INFO L226 Difference]: Without dead ends: 3019 [2022-04-28 15:02:07,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:02:07,462 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:07,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:07,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-28 15:02:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-28 15:02:07,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:07,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,763 INFO L74 IsIncluded]: Start isIncluded. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,765 INFO L87 Difference]: Start difference. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:07,999 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-28 15:02:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-28 15:02:08,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:08,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:08,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3019 states. [2022-04-28 15:02:08,007 INFO L87 Difference]: Start difference. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3019 states. [2022-04-28 15:02:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:08,248 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-28 15:02:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-28 15:02:08,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:08,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:08,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:08,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3655 transitions. [2022-04-28 15:02:08,647 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3655 transitions. Word has length 26 [2022-04-28 15:02:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:08,647 INFO L495 AbstractCegarLoop]: Abstraction has 3017 states and 3655 transitions. [2022-04-28 15:02:08,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:08,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3017 states and 3655 transitions. [2022-04-28 15:02:12,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3655 edges. 3655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3655 transitions. [2022-04-28 15:02:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:02:12,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:12,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:02:12,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:02:12,292 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 1 times [2022-04-28 15:02:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:12,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146088775] [2022-04-28 15:02:12,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:12,293 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 2 times [2022-04-28 15:02:12,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:12,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637954962] [2022-04-28 15:02:12,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:12,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:12,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:12,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {118334#(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(15, 2);call #Ultimate.allocInit(12, 3); {118328#true} is VALID [2022-04-28 15:02:12,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-28 15:02:12,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-28 15:02:12,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {118328#true} call ULTIMATE.init(); {118334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:12,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {118334#(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(15, 2);call #Ultimate.allocInit(12, 3); {118328#true} is VALID [2022-04-28 15:02:12,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-28 15:02:12,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-28 15:02:12,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {118328#true} call #t~ret13 := main(); {118328#true} is VALID [2022-04-28 15:02:12,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {118328#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {118328#true} is VALID [2022-04-28 15:02:12,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {118328#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {118328#true} is VALID [2022-04-28 15:02:12,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {118328#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {118328#true} is VALID [2022-04-28 15:02:12,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {118328#true} assume !(0 != ~p1~0); {118328#true} is VALID [2022-04-28 15:02:12,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {118328#true} assume !(0 != ~p2~0); {118328#true} is VALID [2022-04-28 15:02:12,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {118328#true} assume !(0 != ~p3~0); {118328#true} is VALID [2022-04-28 15:02:12,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {118328#true} assume !(0 != ~p4~0); {118328#true} is VALID [2022-04-28 15:02:12,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {118328#true} assume !(0 != ~p5~0); {118328#true} is VALID [2022-04-28 15:02:12,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {118328#true} assume !(0 != ~p6~0); {118328#true} is VALID [2022-04-28 15:02:12,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {118328#true} assume !(0 != ~p7~0); {118328#true} is VALID [2022-04-28 15:02:12,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {118328#true} assume 0 != ~p8~0;~lk8~0 := 1; {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:12,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:12,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:12,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:12,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:12,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:12,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:12,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:12,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {118333#(= main_~lk8~0 1)} assume 0 != ~p8~0; {118333#(= main_~lk8~0 1)} is VALID [2022-04-28 15:02:12,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {118333#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {118329#false} is VALID [2022-04-28 15:02:12,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {118329#false} assume !false; {118329#false} is VALID [2022-04-28 15:02:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:02:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:12,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637954962] [2022-04-28 15:02:12,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637954962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:12,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:12,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:12,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:12,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146088775] [2022-04-28 15:02:12,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146088775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:12,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:12,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:12,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609857124] [2022-04-28 15:02:12,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 15:02:12,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:12,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:12,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:12,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:12,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:12,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:12,354 INFO L87 Difference]: Start difference. First operand 3017 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:13,753 INFO L93 Difference]: Finished difference Result 4875 states and 5832 transitions. [2022-04-28 15:02:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:13,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 15:02:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 15:02:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 15:02:13,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-28 15:02:13,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:14,773 INFO L225 Difference]: With dead ends: 4875 [2022-04-28 15:02:14,774 INFO L226 Difference]: Without dead ends: 4873 [2022-04-28 15:02:14,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:02:14,775 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:14,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-28 15:02:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-28 15:02:15,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:15,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:15,111 INFO L74 IsIncluded]: Start isIncluded. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:15,114 INFO L87 Difference]: Start difference. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:15,717 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-28 15:02:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-28 15:02:15,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:15,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:15,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4873 states. [2022-04-28 15:02:15,728 INFO L87 Difference]: Start difference. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4873 states. [2022-04-28 15:02:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:16,343 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-28 15:02:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-28 15:02:16,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:16,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:16,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:16,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5447 transitions. [2022-04-28 15:02:17,283 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5447 transitions. Word has length 26 [2022-04-28 15:02:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:17,284 INFO L495 AbstractCegarLoop]: Abstraction has 4617 states and 5447 transitions. [2022-04-28 15:02:17,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:17,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4617 states and 5447 transitions. [2022-04-28 15:02:22,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5447 edges. 5447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5447 transitions. [2022-04-28 15:02:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 15:02:22,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:22,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:02:22,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:02:22,807 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:22,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 1 times [2022-04-28 15:02:22,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:22,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808615345] [2022-04-28 15:02:22,807 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 2 times [2022-04-28 15:02:22,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:22,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999412209] [2022-04-28 15:02:22,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:22,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:22,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:22,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {147076#(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(15, 2);call #Ultimate.allocInit(12, 3); {147070#true} is VALID [2022-04-28 15:02:22,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-28 15:02:22,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-28 15:02:22,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {147070#true} call ULTIMATE.init(); {147076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:02:22,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {147076#(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(15, 2);call #Ultimate.allocInit(12, 3); {147070#true} is VALID [2022-04-28 15:02:22,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-28 15:02:22,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-28 15:02:22,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {147070#true} call #t~ret13 := main(); {147070#true} is VALID [2022-04-28 15:02:22,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {147070#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {147070#true} is VALID [2022-04-28 15:02:22,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {147070#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {147070#true} is VALID [2022-04-28 15:02:22,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {147070#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {147070#true} is VALID [2022-04-28 15:02:22,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {147070#true} assume !(0 != ~p1~0); {147070#true} is VALID [2022-04-28 15:02:22,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {147070#true} assume !(0 != ~p2~0); {147070#true} is VALID [2022-04-28 15:02:22,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {147070#true} assume !(0 != ~p3~0); {147070#true} is VALID [2022-04-28 15:02:22,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {147070#true} assume !(0 != ~p4~0); {147070#true} is VALID [2022-04-28 15:02:22,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {147070#true} assume !(0 != ~p5~0); {147070#true} is VALID [2022-04-28 15:02:22,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {147070#true} assume !(0 != ~p6~0); {147070#true} is VALID [2022-04-28 15:02:22,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {147070#true} assume !(0 != ~p7~0); {147070#true} is VALID [2022-04-28 15:02:22,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {147070#true} assume !(0 != ~p8~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:22,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p1~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:22,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p2~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:22,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p3~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:22,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p4~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:22,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p5~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:22,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p6~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:22,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p7~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-28 15:02:22,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {147075#(= main_~p8~0 0)} assume 0 != ~p8~0; {147071#false} is VALID [2022-04-28 15:02:22,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {147071#false} assume 1 != ~lk8~0; {147071#false} is VALID [2022-04-28 15:02:22,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {147071#false} assume !false; {147071#false} is VALID [2022-04-28 15:02:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:02:22,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:22,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999412209] [2022-04-28 15:02:22,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999412209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:22,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:22,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:22,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:22,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808615345] [2022-04-28 15:02:22,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808615345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:22,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:22,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898260404] [2022-04-28 15:02:22,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:22,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 15:02:22,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:22,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:22,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:22,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:22,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:22,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:22,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:22,866 INFO L87 Difference]: Start difference. First operand 4617 states and 5447 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:27,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:27,868 INFO L93 Difference]: Finished difference Result 10249 states and 11847 transitions. [2022-04-28 15:02:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:02:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 15:02:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:02:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 15:02:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-28 15:02:27,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-28 15:02:27,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:27,951 INFO L225 Difference]: With dead ends: 10249 [2022-04-28 15:02:27,951 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 15:02:27,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:02:27,964 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:02:27,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:02:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 15:02:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 15:02:27,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:02:27,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:02:27,965 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:02:27,965 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:02:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:27,966 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:02:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:02:27,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:27,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:27,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 15:02:27,966 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 15:02:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:02:27,966 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 15:02:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:02:27,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:27,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:02:27,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:02:27,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:02:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 15:02:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 15:02:27,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-28 15:02:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:02:27,967 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 15:02:27,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:02:27,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 15:02:27,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:02:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 15:02:27,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:02:27,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 15:02:27,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:02:27,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 15:02:38,981 WARN L232 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 684 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:02:47,583 WARN L232 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:03:03,844 WARN L232 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 15:03:55,360 WARN L232 SmtUtils]: Spent 10.33s on a formula simplification. DAG size of input: 297 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:04:11,638 WARN L232 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 295 DAG size of output: 159 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 15:04:24,622 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 15:04:24,622 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 15:04:24,622 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 15:04:24,622 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 15:04:24,623 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 15:04:24,623 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 15:04:24,623 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 15:04:24,623 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 15:04:24,623 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 15:04:24,623 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 15:04:24,624 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse14 (= main_~lk3~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse13 (= main_~p4~0 0)) (.cse9 (= main_~lk5~0 1)) (.cse1 (not (= main_~p1~0 0))) (.cse2 (= main_~lk1~0 1)) (.cse10 (= main_~p8~0 0)) (.cse11 (= main_~p7~0 0)) (.cse15 (= main_~lk6~0 1)) (.cse8 (= main_~p3~0 0)) (.cse12 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse15) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse15 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse7 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse15 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse15 .cse8 .cse12))) [2022-04-28 15:04:24,624 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2022-04-28 15:04:24,625 INFO L895 garLoopResultBuilder]: At program point L118(line 118) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (not (= main_~p6~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3))) [2022-04-28 15:04:24,625 INFO L895 garLoopResultBuilder]: At program point L102-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk7~0 1)) (.cse8 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse0 .cse6 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse5 .cse0 .cse6 .cse2 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse7) (and .cse5 .cse8 .cse1 .cse9 .cse4) (and .cse5 .cse8 .cse1 .cse9 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse4) (and .cse5 .cse1 .cse2 .cse9 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse7) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse5 .cse1 .cse2 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse7) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse6 .cse7))) [2022-04-28 15:04:24,625 INFO L902 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-04-28 15:04:24,627 INFO L895 garLoopResultBuilder]: At program point L86-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse4 (= main_~p1~0 0)) (.cse6 (= main_~p2~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse13 (= main_~p8~0 0)) (.cse14 (= main_~lk4~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse12 (= main_~lk1~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse15 (= main_~p3~0 0)) (.cse11 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse10 .cse11) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse10 .cse15) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse7 .cse15) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse10) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse10 .cse15) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse10 .cse15 .cse11))) [2022-04-28 15:04:24,627 INFO L895 garLoopResultBuilder]: At program point L78-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-28 15:04:24,628 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk8~0 1)) (.cse11 (= main_~p7~0 0)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse10 (= main_~p8~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse8 (= main_~p5~0 0)) (.cse9 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse9) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse9))) [2022-04-28 15:04:24,628 INFO L902 garLoopResultBuilder]: At program point L37(lines 37 39) the Hoare annotation is: true [2022-04-28 15:04:24,628 INFO L895 garLoopResultBuilder]: At program point L70-1(lines 35 132) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-28 15:04:24,628 INFO L895 garLoopResultBuilder]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2022-04-28 15:04:24,628 INFO L895 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-04-28 15:04:24,628 INFO L895 garLoopResultBuilder]: At program point L62-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-28 15:04:24,628 INFO L895 garLoopResultBuilder]: At program point L112-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~p7~0 0)) (.cse2 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse1 .cse4 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse5) (and .cse1 .cse4 .cse5) (and .cse3 .cse4 .cse2) (and .cse0 .cse1 .cse5))) [2022-04-28 15:04:24,629 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2022-04-28 15:04:24,629 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) the Hoare annotation is: false [2022-04-28 15:04:24,629 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-04-28 15:04:24,629 INFO L895 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk8~0 1)) (.cse6 (= main_~p7~0 0)) (.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse7))) [2022-04-28 15:04:24,629 INFO L895 garLoopResultBuilder]: At program point L97-1(lines 35 132) the Hoare annotation is: (let ((.cse11 (= main_~p4~0 0)) (.cse7 (= main_~p6~0 0)) (.cse10 (= main_~p5~0 0)) (.cse6 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse9 (= main_~p3~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse6 .cse2 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse7) (and .cse8 .cse6 .cse2 .cse10 .cse7 .cse9) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse5) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse6 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse7 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse11 .cse0 .cse1 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse10 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse5 .cse9) (and .cse11 .cse1 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse5 .cse9) (and .cse8 .cse0 .cse6 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse5 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse5 .cse9) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse9) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse0 .cse6 .cse4 .cse5 .cse9) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse1 .cse7 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse9) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse9) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse5) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7) (and .cse0 .cse6 .cse2 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse11 .cse1 .cse4 .cse10 .cse5 .cse9) (and .cse11 .cse6 .cse4 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse7) (and .cse11 .cse6 .cse4 .cse10 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse0 .cse6 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5))) [2022-04-28 15:04:24,630 INFO L895 garLoopResultBuilder]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2022-04-28 15:04:24,630 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (let ((.cse11 (= main_~lk7~0 1)) (.cse5 (= main_~p6~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse0 (= main_~p4~0 0)) (.cse7 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse10 (= main_~p5~0 0)) (.cse12 (= main_~lk6~0 1)) (.cse9 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse5 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse12 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse12 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse12 .cse9 .cse6))) [2022-04-28 15:04:24,630 INFO L895 garLoopResultBuilder]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (not (= main_~p7~0 0)))) (or (and .cse0 (= main_~p8~0 0) .cse1) (and .cse0 (= main_~lk8~0 1) .cse1))) [2022-04-28 15:04:24,631 INFO L895 garLoopResultBuilder]: At program point L82-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-04-28 15:04:24,631 INFO L895 garLoopResultBuilder]: At program point L107-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p8~0 0)) (.cse5 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse6 .cse3) (and .cse1 .cse4 .cse5 .cse7) (and .cse0 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7) (and .cse2 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse2 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse6 .cse7) (and .cse0 .cse4 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse1 .cse4 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse7))) [2022-04-28 15:04:24,632 INFO L895 garLoopResultBuilder]: At program point L74-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-28 15:04:24,632 INFO L895 garLoopResultBuilder]: At program point L66-1(lines 35 132) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-28 15:04:24,632 INFO L902 garLoopResultBuilder]: At program point L58(lines 58 60) the Hoare annotation is: true [2022-04-28 15:04:24,632 INFO L895 garLoopResultBuilder]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-28 15:04:24,632 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse7 (= main_~p5~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~lk8~0 1)) (.cse3 (not (= main_~p4~0 0))) (.cse4 (= main_~lk4~0 1)) (.cse8 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse5) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse9) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse9) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse5))) [2022-04-28 15:04:24,632 INFO L902 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-04-28 15:04:24,633 INFO L895 garLoopResultBuilder]: At program point L92-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse7 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse4 (= main_~p5~0 0)) (.cse12 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse9 (= main_~p7~0 0)) (.cse5 (= main_~p2~0 0)) (.cse13 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse1 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse6 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse1 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse6 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse13) (and .cse8 .cse1 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse0 .cse7 .cse11 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse12 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse6 .cse10) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse13 .cse12) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse13 .cse10) (and .cse11 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse13 .cse12 .cse10) (and .cse1 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse13))) [2022-04-28 15:04:24,633 INFO L895 garLoopResultBuilder]: At program point L117-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse3 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2022-04-28 15:04:24,636 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 15:04:24,637 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 15:04:24,640 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 15:04:24,643 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 15:04:24,766 INFO L163 areAnnotationChecker]: CFG has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 15:04:24,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:04:24 BoogieIcfgContainer [2022-04-28 15:04:24,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 15:04:24,772 INFO L158 Benchmark]: Toolchain (without parser) took 173771.94ms. Allocated memory was 177.2MB in the beginning and 1.0GB in the end (delta: 854.6MB). Free memory was 121.1MB in the beginning and 819.9MB in the end (delta: -698.8MB). Peak memory consumption was 618.9MB. Max. memory is 8.0GB. [2022-04-28 15:04:24,773 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory was 137.1MB in the beginning and 137.0MB in the end (delta: 93.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:04:24,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.49ms. Allocated memory is still 177.2MB. Free memory was 120.8MB in the beginning and 149.2MB in the end (delta: -28.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-28 15:04:24,773 INFO L158 Benchmark]: Boogie Preprocessor took 28.04ms. Allocated memory is still 177.2MB. Free memory was 149.2MB in the beginning and 147.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 15:04:24,773 INFO L158 Benchmark]: RCFGBuilder took 342.65ms. Allocated memory is still 177.2MB. Free memory was 147.7MB in the beginning and 134.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 15:04:24,773 INFO L158 Benchmark]: TraceAbstraction took 173176.57ms. Allocated memory was 177.2MB in the beginning and 1.0GB in the end (delta: 854.6MB). Free memory was 133.6MB in the beginning and 819.9MB in the end (delta: -686.3MB). Peak memory consumption was 631.7MB. Max. memory is 8.0GB. [2022-04-28 15:04:24,774 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory was 137.1MB in the beginning and 137.0MB in the end (delta: 93.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.49ms. Allocated memory is still 177.2MB. Free memory was 120.8MB in the beginning and 149.2MB in the end (delta: -28.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.04ms. Allocated memory is still 177.2MB. Free memory was 149.2MB in the beginning and 147.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 342.65ms. Allocated memory is still 177.2MB. Free memory was 147.7MB in the beginning and 134.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 173176.57ms. Allocated memory was 177.2MB in the beginning and 1.0GB in the end (delta: 854.6MB). Free memory was 133.6MB in the beginning and 819.9MB in the end (delta: -686.3MB). Peak memory consumption was 631.7MB. 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: 135]: 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 4 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 173.0s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 116.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2238 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2238 mSDsluCounter, 1720 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1564 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=21, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 39 PreInvPairs, 5808 NumberOfFragments, 22569 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 56.6s HoareSimplificationTime, 39 FomulaSimplificationsInter, 565747 FormulaSimplificationTreeSizeReductionInter, 60.0s 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 15:04:24,815 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...