/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:09:56,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:09:56,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:09:56,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:09:56,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:09:56,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:09:56,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:09:56,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:09:56,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:09:56,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:09:56,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:09:56,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:09:56,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:09:56,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:09:56,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:09:56,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:09:56,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:09:56,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:09:56,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:09:56,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:09:56,076 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:09:56,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:09:56,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:09:56,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:09:56,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:09:56,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:09:56,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:09:56,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:09:56,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:09:56,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:09:56,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:09:56,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:09:56,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:09:56,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:09:56,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:09:56,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:09:56,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:09:56,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:09:56,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:09:56,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:09:56,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:09:56,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:09:56,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:09:56,118 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:09:56,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:09:56,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:09:56,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:09:56,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:09:56,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:09:56,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:09:56,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:09:56,120 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:09:56,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:09:56,120 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:09:56,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:09:56,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:09:56,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:09:56,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:09:56,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:09:56,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:09:56,121 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:09:56,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:09:56,121 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:09:56,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:09:56,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:09:56,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:09:56,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:09:56,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:56,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:09:56,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:09:56,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:09:56,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:09:56,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:09:56,122 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:09:56,122 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:09:56,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:09:56,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:09:56,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:09:56,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:09:56,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:09:56,329 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:09:56,330 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:09:56,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-27 15:09:56,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb2184f8/49a7b0f377b14e02bf0fad3d43762e51/FLAG6d9d122d4 [2022-04-27 15:09:56,724 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:09:56,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2022-04-27 15:09:56,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb2184f8/49a7b0f377b14e02bf0fad3d43762e51/FLAG6d9d122d4 [2022-04-27 15:09:57,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb2184f8/49a7b0f377b14e02bf0fad3d43762e51 [2022-04-27 15:09:57,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:09:57,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:09:57,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:57,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:09:57,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:09:57,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77043eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57, skipping insertion in model container [2022-04-27 15:09:57,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:09:57,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:09:57,373 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_15-2.c[5628,5641] [2022-04-27 15:09:57,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:57,405 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:09:57,424 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_15-2.c[5628,5641] [2022-04-27 15:09:57,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:57,433 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:09:57,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57 WrapperNode [2022-04-27 15:09:57,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:57,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:09:57,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:09:57,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:09:57,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:09:57,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:09:57,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:09:57,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:09:57,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57" (1/1) ... [2022-04-27 15:09:57,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:57,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:09:57,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:09:57,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:09:57,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:09:57,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:09:57,549 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:09:57,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:09:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:09:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:09:57,597 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:09:57,598 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:09:57,847 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:09:57,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:09:57,852 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:09:57,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:57 BoogieIcfgContainer [2022-04-27 15:09:57,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:09:57,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:09:57,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:09:57,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:09:57,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:09:57" (1/3) ... [2022-04-27 15:09:57,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407a969b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:57, skipping insertion in model container [2022-04-27 15:09:57,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:57" (2/3) ... [2022-04-27 15:09:57,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407a969b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:57, skipping insertion in model container [2022-04-27 15:09:57,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:57" (3/3) ... [2022-04-27 15:09:57,868 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2022-04-27 15:09:57,877 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:09:57,877 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:09:57,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:09:57,918 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a7c1d31, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7bc4f339 [2022-04-27 15:09:57,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:09:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 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-27 15:09:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:57,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:57,929 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-27 15:09:57,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 1 times [2022-04-27 15:09:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:57,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509715416] [2022-04-27 15:09:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:57,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:58,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(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(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-27 15:09:58,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-27 15:09:58,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-27 15:09:58,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:58,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(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(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-27 15:09:58,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-27 15:09:58,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-27 15:09:58,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret20 := main(); {63#true} is VALID [2022-04-27 15:09:58,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {63#true} is VALID [2022-04-27 15:09:58,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {63#true} is VALID [2022-04-27 15:09:58,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {63#true} is VALID [2022-04-27 15:09:58,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#true} assume 0 != ~p1~0;~lk1~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p1~0; {68#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:58,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {64#false} is VALID [2022-04-27 15:09:58,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-04-27 15:09:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509715416] [2022-04-27 15:09:58,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509715416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:58,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:58,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858736053] [2022-04-27 15:09:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:58,208 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-27 15:09:58,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:58,211 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-27 15:09:58,242 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-27 15:09:58,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:58,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:58,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:58,269 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 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 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-27 15:09:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:58,603 INFO L93 Difference]: Finished difference Result 118 states and 211 transitions. [2022-04-27 15:09:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:58,604 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-27 15:09:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:58,605 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-27 15:09:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-27 15:09:58,616 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-27 15:09:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-27 15:09:58,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-27 15:09:58,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:58,810 INFO L225 Difference]: With dead ends: 118 [2022-04-27 15:09:58,810 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 15:09:58,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:58,814 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 259 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:58,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 119 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 15:09:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-27 15:09:58,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:58,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 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-27 15:09:58,838 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 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-27 15:09:58,839 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 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-27 15:09:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:58,843 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-27 15:09:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-27 15:09:58,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:58,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:58,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 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 103 states. [2022-04-27 15:09:58,845 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 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 103 states. [2022-04-27 15:09:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:58,850 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-27 15:09:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-27 15:09:58,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:58,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:58,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:58,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 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-27 15:09:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-27 15:09:58,854 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-27 15:09:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:58,855 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-27 15:09:58,856 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-27 15:09:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-27 15:09:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:58,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:58,857 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-27 15:09:58,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:09:58,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 1 times [2022-04-27 15:09:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:58,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5930405] [2022-04-27 15:09:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:58,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#(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(18, 2);call #Ultimate.allocInit(12, 3); {488#true} is VALID [2022-04-27 15:09:58,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {488#true} assume true; {488#true} is VALID [2022-04-27 15:09:58,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {488#true} {488#true} #285#return; {488#true} is VALID [2022-04-27 15:09:58,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:58,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#(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(18, 2);call #Ultimate.allocInit(12, 3); {488#true} is VALID [2022-04-27 15:09:58,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2022-04-27 15:09:58,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #285#return; {488#true} is VALID [2022-04-27 15:09:58,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret20 := main(); {488#true} is VALID [2022-04-27 15:09:58,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {488#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {488#true} is VALID [2022-04-27 15:09:58,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {488#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {488#true} is VALID [2022-04-27 15:09:58,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {488#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {488#true} is VALID [2022-04-27 15:09:58,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#true} assume !(0 != ~p1~0); {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {493#(= main_~p1~0 0)} assume !(0 != ~p2~0); {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {493#(= main_~p1~0 0)} assume !(0 != ~p10~0); {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {493#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:58,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {493#(= main_~p1~0 0)} assume 0 != ~p1~0; {489#false} is VALID [2022-04-27 15:09:58,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {489#false} assume 1 != ~lk1~0; {489#false} is VALID [2022-04-27 15:09:58,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {489#false} assume !false; {489#false} is VALID [2022-04-27 15:09:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:58,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:58,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5930405] [2022-04-27 15:09:58,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5930405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:58,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:58,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417356660] [2022-04-27 15:09:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:58,985 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-27 15:09:58,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:58,986 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-27 15:09:59,005 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-27 15:09:59,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:59,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:59,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:59,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:59,007 INFO L87 Difference]: Start difference. First operand 71 states and 130 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-27 15:09:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:59,285 INFO L93 Difference]: Finished difference Result 168 states and 313 transitions. [2022-04-27 15:09:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:59,285 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-27 15:09:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:59,285 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-27 15:09:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-27 15:09:59,288 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-27 15:09:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2022-04-27 15:09:59,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 282 transitions. [2022-04-27 15:09:59,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:59,491 INFO L225 Difference]: With dead ends: 168 [2022-04-27 15:09:59,491 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 15:09:59,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:59,492 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 223 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:59,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 135 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 15:09:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-27 15:09:59,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:59,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 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-27 15:09:59,498 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 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-27 15:09:59,499 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 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-27 15:09:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:59,510 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-27 15:09:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-27 15:09:59,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:59,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:59,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 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 103 states. [2022-04-27 15:09:59,515 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 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 103 states. [2022-04-27 15:09:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:59,518 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2022-04-27 15:09:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2022-04-27 15:09:59,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:59,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:59,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:59,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 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-27 15:09:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2022-04-27 15:09:59,522 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 26 [2022-04-27 15:09:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:59,523 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 186 transitions. [2022-04-27 15:09:59,523 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-27 15:09:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 186 transitions. [2022-04-27 15:09:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:59,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:59,524 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, 1] [2022-04-27 15:09:59,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:09:59,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2121315188, now seen corresponding path program 1 times [2022-04-27 15:09:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:59,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466144366] [2022-04-27 15:09:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:59,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:59,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:59,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {998#(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(18, 2);call #Ultimate.allocInit(12, 3); {992#true} is VALID [2022-04-27 15:09:59,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {992#true} assume true; {992#true} is VALID [2022-04-27 15:09:59,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {992#true} {992#true} #285#return; {992#true} is VALID [2022-04-27 15:09:59,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {992#true} call ULTIMATE.init(); {998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:59,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#(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(18, 2);call #Ultimate.allocInit(12, 3); {992#true} is VALID [2022-04-27 15:09:59,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {992#true} assume true; {992#true} is VALID [2022-04-27 15:09:59,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {992#true} {992#true} #285#return; {992#true} is VALID [2022-04-27 15:09:59,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {992#true} call #t~ret20 := main(); {992#true} is VALID [2022-04-27 15:09:59,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {992#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {992#true} is VALID [2022-04-27 15:09:59,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {992#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {992#true} is VALID [2022-04-27 15:09:59,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {992#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {992#true} is VALID [2022-04-27 15:09:59,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {992#true} assume 0 != ~p1~0;~lk1~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {997#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {997#(not (= main_~p1~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {997#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:59,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {997#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {993#false} is VALID [2022-04-27 15:09:59,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {993#false} assume 0 != ~p2~0; {993#false} is VALID [2022-04-27 15:09:59,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {993#false} assume 1 != ~lk2~0; {993#false} is VALID [2022-04-27 15:09:59,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {993#false} assume !false; {993#false} is VALID [2022-04-27 15:09:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:59,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466144366] [2022-04-27 15:09:59,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466144366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:59,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:59,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:59,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202150828] [2022-04-27 15:09:59,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:59,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:09:59,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:59,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:09:59,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:59,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:59,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:59,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:59,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:59,627 INFO L87 Difference]: Start difference. First operand 101 states and 186 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:09:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:59,847 INFO L93 Difference]: Finished difference Result 154 states and 280 transitions. [2022-04-27 15:09:59,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:59,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:09:59,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:09:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-27 15:09:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:09:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2022-04-27 15:09:59,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 277 transitions. [2022-04-27 15:10:00,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:00,038 INFO L225 Difference]: With dead ends: 154 [2022-04-27 15:10:00,038 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 15:10:00,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:00,051 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:00,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 163 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 15:10:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-27 15:10:00,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:00,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 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-27 15:10:00,057 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 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-27 15:10:00,058 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 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-27 15:10:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:00,060 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-27 15:10:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-27 15:10:00,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:00,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:00,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 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 106 states. [2022-04-27 15:10:00,061 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 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 106 states. [2022-04-27 15:10:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:00,064 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-27 15:10:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-27 15:10:00,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:00,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:00,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:00,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 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-27 15:10:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-27 15:10:00,067 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 27 [2022-04-27 15:10:00,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:00,067 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-27 15:10:00,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-27 15:10:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:10:00,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:00,068 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, 1] [2022-04-27 15:10:00,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:10:00,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:00,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash 484708366, now seen corresponding path program 1 times [2022-04-27 15:10:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:00,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056614794] [2022-04-27 15:10:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:00,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:00,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {1499#(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(18, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-27 15:10:00,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-27 15:10:00,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1493#true} {1493#true} #285#return; {1493#true} is VALID [2022-04-27 15:10:00,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1499#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:00,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {1499#(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(18, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-27 15:10:00,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-27 15:10:00,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #285#return; {1493#true} is VALID [2022-04-27 15:10:00,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret20 := main(); {1493#true} is VALID [2022-04-27 15:10:00,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {1493#true} is VALID [2022-04-27 15:10:00,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {1493#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {1493#true} is VALID [2022-04-27 15:10:00,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {1493#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {1493#true} is VALID [2022-04-27 15:10:00,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {1493#true} assume !(0 != ~p1~0); {1493#true} is VALID [2022-04-27 15:10:00,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {1493#true} assume !(0 != ~p2~0); {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {1498#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {1498#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1498#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:00,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {1498#(= main_~p2~0 0)} assume 0 != ~p2~0; {1494#false} is VALID [2022-04-27 15:10:00,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {1494#false} assume 1 != ~lk2~0; {1494#false} is VALID [2022-04-27 15:10:00,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-27 15:10:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:00,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:00,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056614794] [2022-04-27 15:10:00,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056614794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:00,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:00,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595172411] [2022-04-27 15:10:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:00,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:10:00,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:00,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:00,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:00,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:00,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:00,156 INFO L87 Difference]: Start difference. First operand 104 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:00,388 INFO L93 Difference]: Finished difference Result 292 states and 540 transitions. [2022-04-27 15:10:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:00,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:10:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-27 15:10:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-04-27 15:10:00,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 280 transitions. [2022-04-27 15:10:00,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:00,576 INFO L225 Difference]: With dead ends: 292 [2022-04-27 15:10:00,576 INFO L226 Difference]: Without dead ends: 197 [2022-04-27 15:10:00,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:00,578 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 248 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:00,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 109 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-27 15:10:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-04-27 15:10:00,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:00,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 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-27 15:10:00,592 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 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-27 15:10:00,593 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 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-27 15:10:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:00,598 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-27 15:10:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-27 15:10:00,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:00,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:00,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 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 197 states. [2022-04-27 15:10:00,600 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 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 197 states. [2022-04-27 15:10:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:00,604 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2022-04-27 15:10:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2022-04-27 15:10:00,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:00,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:00,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:00,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 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-27 15:10:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 357 transitions. [2022-04-27 15:10:00,618 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 357 transitions. Word has length 27 [2022-04-27 15:10:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:00,618 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 357 transitions. [2022-04-27 15:10:00,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 357 transitions. [2022-04-27 15:10:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:10:00,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:00,619 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, 1] [2022-04-27 15:10:00,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:10:00,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1816114224, now seen corresponding path program 1 times [2022-04-27 15:10:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:00,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160167976] [2022-04-27 15:10:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:00,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:00,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {2416#(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(18, 2);call #Ultimate.allocInit(12, 3); {2410#true} is VALID [2022-04-27 15:10:00,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-27 15:10:00,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2410#true} {2410#true} #285#return; {2410#true} is VALID [2022-04-27 15:10:00,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} call ULTIMATE.init(); {2416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:00,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {2416#(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(18, 2);call #Ultimate.allocInit(12, 3); {2410#true} is VALID [2022-04-27 15:10:00,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-27 15:10:00,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2410#true} {2410#true} #285#return; {2410#true} is VALID [2022-04-27 15:10:00,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {2410#true} call #t~ret20 := main(); {2410#true} is VALID [2022-04-27 15:10:00,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {2410#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {2410#true} is VALID [2022-04-27 15:10:00,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {2410#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {2410#true} is VALID [2022-04-27 15:10:00,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {2410#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {2410#true} is VALID [2022-04-27 15:10:00,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {2410#true} assume !(0 != ~p1~0); {2410#true} is VALID [2022-04-27 15:10:00,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {2410#true} assume 0 != ~p2~0;~lk2~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {2415#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {2415#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {2415#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2415#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:00,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {2415#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2411#false} is VALID [2022-04-27 15:10:00,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {2411#false} assume !false; {2411#false} is VALID [2022-04-27 15:10:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:00,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:00,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160167976] [2022-04-27 15:10:00,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160167976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:00,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:00,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:00,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762814927] [2022-04-27 15:10:00,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:00,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:10:00,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:00,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:00,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:00,708 INFO L87 Difference]: Start difference. First operand 195 states and 357 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:00,953 INFO L93 Difference]: Finished difference Result 255 states and 467 transitions. [2022-04-27 15:10:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2022-04-27 15:10:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-27 15:10:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-27 15:10:00,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-27 15:10:01,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:01,098 INFO L225 Difference]: With dead ends: 255 [2022-04-27 15:10:01,098 INFO L226 Difference]: Without dead ends: 253 [2022-04-27 15:10:01,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:01,099 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:01,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 188 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-27 15:10:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2022-04-27 15:10:01,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:01,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 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-27 15:10:01,106 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 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-27 15:10:01,107 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 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-27 15:10:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:01,113 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-27 15:10:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-27 15:10:01,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:01,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:01,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 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 253 states. [2022-04-27 15:10:01,114 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 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 253 states. [2022-04-27 15:10:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:01,120 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2022-04-27 15:10:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 464 transitions. [2022-04-27 15:10:01,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:01,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:01,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:01,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 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-27 15:10:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 355 transitions. [2022-04-27 15:10:01,125 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 355 transitions. Word has length 27 [2022-04-27 15:10:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:01,126 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 355 transitions. [2022-04-27 15:10:01,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-27 15:10:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2022-04-27 15:10:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:10:01,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:01,126 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, 1, 1] [2022-04-27 15:10:01,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:10:01,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:01,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2141269562, now seen corresponding path program 1 times [2022-04-27 15:10:01,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:01,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502731697] [2022-04-27 15:10:01,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:01,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:01,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {3408#(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(18, 2);call #Ultimate.allocInit(12, 3); {3402#true} is VALID [2022-04-27 15:10:01,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {3402#true} assume true; {3402#true} is VALID [2022-04-27 15:10:01,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3402#true} {3402#true} #285#return; {3402#true} is VALID [2022-04-27 15:10:01,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {3402#true} call ULTIMATE.init(); {3408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:01,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {3408#(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(18, 2);call #Ultimate.allocInit(12, 3); {3402#true} is VALID [2022-04-27 15:10:01,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {3402#true} assume true; {3402#true} is VALID [2022-04-27 15:10:01,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3402#true} {3402#true} #285#return; {3402#true} is VALID [2022-04-27 15:10:01,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {3402#true} call #t~ret20 := main(); {3402#true} is VALID [2022-04-27 15:10:01,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {3402#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {3402#true} is VALID [2022-04-27 15:10:01,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {3402#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {3402#true} is VALID [2022-04-27 15:10:01,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {3402#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {3402#true} is VALID [2022-04-27 15:10:01,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {3402#true} assume !(0 != ~p1~0); {3402#true} is VALID [2022-04-27 15:10:01,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {3402#true} assume !(0 != ~p2~0); {3402#true} is VALID [2022-04-27 15:10:01,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {3402#true} assume 0 != ~p3~0;~lk3~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {3407#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {3407#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {3407#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {3407#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3407#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:01,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {3407#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3403#false} is VALID [2022-04-27 15:10:01,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {3403#false} assume !false; {3403#false} is VALID [2022-04-27 15:10:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:01,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:01,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502731697] [2022-04-27 15:10:01,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502731697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:01,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:01,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:01,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120272674] [2022-04-27 15:10:01,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:10:01,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:01,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:01,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:01,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:01,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:01,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:01,215 INFO L87 Difference]: Start difference. First operand 195 states and 355 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:01,438 INFO L93 Difference]: Finished difference Result 371 states and 683 transitions. [2022-04-27 15:10:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:01,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:10:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-27 15:10:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-27 15:10:01,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-27 15:10:01,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:01,569 INFO L225 Difference]: With dead ends: 371 [2022-04-27 15:10:01,569 INFO L226 Difference]: Without dead ends: 369 [2022-04-27 15:10:01,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:01,570 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 239 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:01,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 106 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-27 15:10:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2022-04-27 15:10:01,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:01,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 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-27 15:10:01,577 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 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-27 15:10:01,577 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 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-27 15:10:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:01,592 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-27 15:10:01,592 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-27 15:10:01,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:01,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:01,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 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 369 states. [2022-04-27 15:10:01,593 INFO L87 Difference]: Start difference. First operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 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 369 states. [2022-04-27 15:10:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:01,599 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2022-04-27 15:10:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 678 transitions. [2022-04-27 15:10:01,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:01,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:01,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:01,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 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-27 15:10:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 477 transitions. [2022-04-27 15:10:01,604 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 477 transitions. Word has length 28 [2022-04-27 15:10:01,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:01,605 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 477 transitions. [2022-04-27 15:10:01,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 477 transitions. [2022-04-27 15:10:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:10:01,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:01,605 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, 1, 1] [2022-04-27 15:10:01,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:10:01,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:01,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash 147124856, now seen corresponding path program 1 times [2022-04-27 15:10:01,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:01,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324185609] [2022-04-27 15:10:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:01,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:01,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {4818#(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(18, 2);call #Ultimate.allocInit(12, 3); {4812#true} is VALID [2022-04-27 15:10:01,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {4812#true} assume true; {4812#true} is VALID [2022-04-27 15:10:01,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4812#true} {4812#true} #285#return; {4812#true} is VALID [2022-04-27 15:10:01,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {4812#true} call ULTIMATE.init(); {4818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:01,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {4818#(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(18, 2);call #Ultimate.allocInit(12, 3); {4812#true} is VALID [2022-04-27 15:10:01,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {4812#true} assume true; {4812#true} is VALID [2022-04-27 15:10:01,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4812#true} {4812#true} #285#return; {4812#true} is VALID [2022-04-27 15:10:01,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {4812#true} call #t~ret20 := main(); {4812#true} is VALID [2022-04-27 15:10:01,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {4812#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {4812#true} is VALID [2022-04-27 15:10:01,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {4812#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {4812#true} is VALID [2022-04-27 15:10:01,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {4812#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {4812#true} is VALID [2022-04-27 15:10:01,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {4812#true} assume !(0 != ~p1~0); {4812#true} is VALID [2022-04-27 15:10:01,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {4812#true} assume !(0 != ~p2~0); {4812#true} is VALID [2022-04-27 15:10:01,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {4812#true} assume !(0 != ~p3~0); {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {4817#(= main_~p3~0 0)} assume !(0 != ~p10~0); {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {4817#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {4817#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4817#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:01,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {4817#(= main_~p3~0 0)} assume 0 != ~p3~0; {4813#false} is VALID [2022-04-27 15:10:01,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {4813#false} assume 1 != ~lk3~0; {4813#false} is VALID [2022-04-27 15:10:01,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {4813#false} assume !false; {4813#false} is VALID [2022-04-27 15:10:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:01,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:01,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324185609] [2022-04-27 15:10:01,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324185609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:01,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:01,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994418624] [2022-04-27 15:10:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:10:01,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:01,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:01,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:01,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:01,715 INFO L87 Difference]: Start difference. First operand 263 states and 477 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:01,924 INFO L93 Difference]: Finished difference Result 631 states and 1155 transitions. [2022-04-27 15:10:01,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:01,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2022-04-27 15:10:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-27 15:10:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2022-04-27 15:10:01,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 276 transitions. [2022-04-27 15:10:02,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:02,089 INFO L225 Difference]: With dead ends: 631 [2022-04-27 15:10:02,089 INFO L226 Difference]: Without dead ends: 377 [2022-04-27 15:10:02,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:02,095 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:02,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 139 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-27 15:10:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2022-04-27 15:10:02,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:02,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 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-27 15:10:02,103 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 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-27 15:10:02,103 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 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-27 15:10:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:02,109 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-27 15:10:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-27 15:10:02,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:02,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:02,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 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 377 states. [2022-04-27 15:10:02,111 INFO L87 Difference]: Start difference. First operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 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 377 states. [2022-04-27 15:10:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:02,118 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2022-04-27 15:10:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 680 transitions. [2022-04-27 15:10:02,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:02,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:02,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:02,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 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-27 15:10:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 679 transitions. [2022-04-27 15:10:02,125 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 679 transitions. Word has length 28 [2022-04-27 15:10:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:02,125 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 679 transitions. [2022-04-27 15:10:02,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-27 15:10:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 679 transitions. [2022-04-27 15:10:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:10:02,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:02,126 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, 1, 1, 1] [2022-04-27 15:10:02,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:10:02,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1955059427, now seen corresponding path program 1 times [2022-04-27 15:10:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:02,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118049111] [2022-04-27 15:10:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:02,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:02,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {6624#(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(18, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-27 15:10:02,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-27 15:10:02,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6618#true} {6618#true} #285#return; {6618#true} is VALID [2022-04-27 15:10:02,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {6618#true} call ULTIMATE.init(); {6624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:02,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {6624#(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(18, 2);call #Ultimate.allocInit(12, 3); {6618#true} is VALID [2022-04-27 15:10:02,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {6618#true} assume true; {6618#true} is VALID [2022-04-27 15:10:02,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6618#true} {6618#true} #285#return; {6618#true} is VALID [2022-04-27 15:10:02,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {6618#true} call #t~ret20 := main(); {6618#true} is VALID [2022-04-27 15:10:02,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {6618#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {6618#true} is VALID [2022-04-27 15:10:02,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {6618#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {6618#true} is VALID [2022-04-27 15:10:02,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {6618#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {6618#true} is VALID [2022-04-27 15:10:02,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {6618#true} assume !(0 != ~p1~0); {6618#true} is VALID [2022-04-27 15:10:02,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {6618#true} assume !(0 != ~p2~0); {6618#true} is VALID [2022-04-27 15:10:02,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {6618#true} assume 0 != ~p3~0;~lk3~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {6623#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {6623#(not (= main_~p3~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {6623#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {6623#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {6623#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:02,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {6623#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6619#false} is VALID [2022-04-27 15:10:02,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {6619#false} assume 0 != ~p4~0; {6619#false} is VALID [2022-04-27 15:10:02,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {6619#false} assume 1 != ~lk4~0; {6619#false} is VALID [2022-04-27 15:10:02,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {6619#false} assume !false; {6619#false} is VALID [2022-04-27 15:10:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:02,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118049111] [2022-04-27 15:10:02,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118049111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:02,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:02,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870440725] [2022-04-27 15:10:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:02,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:10:02,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:02,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:02,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:02,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:02,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:02,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:02,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:02,181 INFO L87 Difference]: Start difference. First operand 375 states and 679 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:02,421 INFO L93 Difference]: Finished difference Result 565 states and 1021 transitions. [2022-04-27 15:10:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:10:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-27 15:10:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-04-27 15:10:02,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 271 transitions. [2022-04-27 15:10:02,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:02,603 INFO L225 Difference]: With dead ends: 565 [2022-04-27 15:10:02,603 INFO L226 Difference]: Without dead ends: 383 [2022-04-27 15:10:02,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:02,605 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:02,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 157 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-27 15:10:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2022-04-27 15:10:02,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:02,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 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-27 15:10:02,621 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 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-27 15:10:02,622 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 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-27 15:10:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:02,628 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-27 15:10:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-27 15:10:02,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:02,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:02,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 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 383 states. [2022-04-27 15:10:02,630 INFO L87 Difference]: Start difference. First operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 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 383 states. [2022-04-27 15:10:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:02,636 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2022-04-27 15:10:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 684 transitions. [2022-04-27 15:10:02,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:02,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:02,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:02,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 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-27 15:10:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 683 transitions. [2022-04-27 15:10:02,644 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 683 transitions. Word has length 29 [2022-04-27 15:10:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:02,644 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 683 transitions. [2022-04-27 15:10:02,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 683 transitions. [2022-04-27 15:10:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:10:02,646 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:02,646 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, 1, 1, 1] [2022-04-27 15:10:02,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:10:02,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:02,647 INFO L85 PathProgramCache]: Analyzing trace with hash 266115685, now seen corresponding path program 1 times [2022-04-27 15:10:02,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:02,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657824747] [2022-04-27 15:10:02,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:02,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:02,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:02,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {8382#(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(18, 2);call #Ultimate.allocInit(12, 3); {8376#true} is VALID [2022-04-27 15:10:02,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {8376#true} assume true; {8376#true} is VALID [2022-04-27 15:10:02,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8376#true} {8376#true} #285#return; {8376#true} is VALID [2022-04-27 15:10:02,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {8376#true} call ULTIMATE.init(); {8382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {8382#(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(18, 2);call #Ultimate.allocInit(12, 3); {8376#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {8376#true} assume true; {8376#true} is VALID [2022-04-27 15:10:02,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8376#true} {8376#true} #285#return; {8376#true} is VALID [2022-04-27 15:10:02,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {8376#true} call #t~ret20 := main(); {8376#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {8376#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {8376#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {8376#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {8376#true} is VALID [2022-04-27 15:10:02,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {8376#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {8376#true} is VALID [2022-04-27 15:10:02,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {8376#true} assume !(0 != ~p1~0); {8376#true} is VALID [2022-04-27 15:10:02,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {8376#true} assume !(0 != ~p2~0); {8376#true} is VALID [2022-04-27 15:10:02,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {8376#true} assume !(0 != ~p3~0); {8376#true} is VALID [2022-04-27 15:10:02,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {8376#true} assume 0 != ~p4~0;~lk4~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {8381#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {8381#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {8381#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {8381#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {8381#(= main_~lk4~0 1)} assume 0 != ~p4~0; {8381#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:02,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {8381#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {8377#false} is VALID [2022-04-27 15:10:02,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {8377#false} assume !false; {8377#false} is VALID [2022-04-27 15:10:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:02,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657824747] [2022-04-27 15:10:02,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657824747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:02,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:02,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:02,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867870583] [2022-04-27 15:10:02,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:10:02,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:02,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:02,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:02,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:02,730 INFO L87 Difference]: Start difference. First operand 381 states and 683 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:02,947 INFO L93 Difference]: Finished difference Result 717 states and 1301 transitions. [2022-04-27 15:10:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:02,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:10:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-27 15:10:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-04-27 15:10:02,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2022-04-27 15:10:03,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:03,093 INFO L225 Difference]: With dead ends: 717 [2022-04-27 15:10:03,093 INFO L226 Difference]: Without dead ends: 715 [2022-04-27 15:10:03,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:03,095 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:03,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 105 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-27 15:10:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 521. [2022-04-27 15:10:03,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:03,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 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-27 15:10:03,105 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 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-27 15:10:03,106 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 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-27 15:10:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:03,124 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-27 15:10:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-27 15:10:03,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:03,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:03,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 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-27 15:10:03,127 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 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-27 15:10:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:03,143 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2022-04-27 15:10:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1292 transitions. [2022-04-27 15:10:03,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:03,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:03,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:03,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 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-27 15:10:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2022-04-27 15:10:03,155 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 29 [2022-04-27 15:10:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:03,155 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2022-04-27 15:10:03,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2022-04-27 15:10:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:10:03,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:03,157 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, 1, 1, 1] [2022-04-27 15:10:03,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:10:03,157 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1728029021, now seen corresponding path program 1 times [2022-04-27 15:10:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:03,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204935364] [2022-04-27 15:10:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:03,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:03,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {11100#(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(18, 2);call #Ultimate.allocInit(12, 3); {11094#true} is VALID [2022-04-27 15:10:03,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {11094#true} assume true; {11094#true} is VALID [2022-04-27 15:10:03,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11094#true} {11094#true} #285#return; {11094#true} is VALID [2022-04-27 15:10:03,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {11094#true} call ULTIMATE.init(); {11100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:03,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {11100#(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(18, 2);call #Ultimate.allocInit(12, 3); {11094#true} is VALID [2022-04-27 15:10:03,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {11094#true} assume true; {11094#true} is VALID [2022-04-27 15:10:03,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11094#true} {11094#true} #285#return; {11094#true} is VALID [2022-04-27 15:10:03,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {11094#true} call #t~ret20 := main(); {11094#true} is VALID [2022-04-27 15:10:03,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {11094#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {11094#true} is VALID [2022-04-27 15:10:03,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {11094#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {11094#true} is VALID [2022-04-27 15:10:03,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {11094#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {11094#true} is VALID [2022-04-27 15:10:03,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {11094#true} assume !(0 != ~p1~0); {11094#true} is VALID [2022-04-27 15:10:03,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {11094#true} assume !(0 != ~p2~0); {11094#true} is VALID [2022-04-27 15:10:03,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {11094#true} assume !(0 != ~p3~0); {11094#true} is VALID [2022-04-27 15:10:03,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {11094#true} assume !(0 != ~p4~0); {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {11099#(= main_~p4~0 0)} assume !(0 != ~p10~0); {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {11099#(= main_~p4~0 0)} assume !(0 != ~p1~0); {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {11099#(= main_~p4~0 0)} assume !(0 != ~p2~0); {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {11099#(= main_~p4~0 0)} assume !(0 != ~p3~0); {11099#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:03,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {11099#(= main_~p4~0 0)} assume 0 != ~p4~0; {11095#false} is VALID [2022-04-27 15:10:03,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {11095#false} assume 1 != ~lk4~0; {11095#false} is VALID [2022-04-27 15:10:03,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {11095#false} assume !false; {11095#false} is VALID [2022-04-27 15:10:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:03,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204935364] [2022-04-27 15:10:03,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204935364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:03,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:03,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252831888] [2022-04-27 15:10:03,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:03,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:10:03,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:03,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:03,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:03,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:03,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:03,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:03,239 INFO L87 Difference]: Start difference. First operand 521 states and 923 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:03,514 INFO L93 Difference]: Finished difference Result 1245 states and 2221 transitions. [2022-04-27 15:10:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:03,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-27 15:10:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-27 15:10:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2022-04-27 15:10:03,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 273 transitions. [2022-04-27 15:10:03,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:03,721 INFO L225 Difference]: With dead ends: 1245 [2022-04-27 15:10:03,721 INFO L226 Difference]: Without dead ends: 739 [2022-04-27 15:10:03,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:03,722 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 205 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:03,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 141 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-04-27 15:10:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2022-04-27 15:10:03,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:03,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 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-27 15:10:03,738 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 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-27 15:10:03,739 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 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-27 15:10:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:03,760 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-27 15:10:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-27 15:10:03,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:03,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:03,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 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 739 states. [2022-04-27 15:10:03,763 INFO L87 Difference]: Start difference. First operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 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 739 states. [2022-04-27 15:10:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:03,780 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2022-04-27 15:10:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1304 transitions. [2022-04-27 15:10:03,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:03,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:03,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:03,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 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-27 15:10:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1303 transitions. [2022-04-27 15:10:03,798 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1303 transitions. Word has length 29 [2022-04-27 15:10:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:03,798 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 1303 transitions. [2022-04-27 15:10:03,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-27 15:10:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1303 transitions. [2022-04-27 15:10:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:10:03,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:03,799 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, 1, 1, 1, 1] [2022-04-27 15:10:03,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:10:03,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:03,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash -340135571, now seen corresponding path program 1 times [2022-04-27 15:10:03,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:03,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457097821] [2022-04-27 15:10:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:03,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:03,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:03,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {14626#(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(18, 2);call #Ultimate.allocInit(12, 3); {14620#true} is VALID [2022-04-27 15:10:03,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {14620#true} assume true; {14620#true} is VALID [2022-04-27 15:10:03,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14620#true} {14620#true} #285#return; {14620#true} is VALID [2022-04-27 15:10:03,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {14620#true} call ULTIMATE.init(); {14626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:03,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {14626#(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(18, 2);call #Ultimate.allocInit(12, 3); {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {14620#true} assume true; {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14620#true} {14620#true} #285#return; {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {14620#true} call #t~ret20 := main(); {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {14620#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {14620#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {14620#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {14620#true} assume !(0 != ~p1~0); {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {14620#true} assume !(0 != ~p2~0); {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {14620#true} assume !(0 != ~p3~0); {14620#true} is VALID [2022-04-27 15:10:03,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {14620#true} assume 0 != ~p4~0;~lk4~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {14625#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {14625#(not (= main_~p4~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {14625#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {14625#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {14625#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {14625#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:03,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {14625#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {14621#false} is VALID [2022-04-27 15:10:03,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {14621#false} assume 0 != ~p5~0; {14621#false} is VALID [2022-04-27 15:10:03,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {14621#false} assume 1 != ~lk5~0; {14621#false} is VALID [2022-04-27 15:10:03,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {14621#false} assume !false; {14621#false} is VALID [2022-04-27 15:10:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:03,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457097821] [2022-04-27 15:10:03,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457097821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:03,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:03,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332228090] [2022-04-27 15:10:03,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:03,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:10:03,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:03,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:03,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:03,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:03,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:03,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:03,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:03,855 INFO L87 Difference]: Start difference. First operand 737 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:04,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:04,072 INFO L93 Difference]: Finished difference Result 1105 states and 1949 transitions. [2022-04-27 15:10:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:04,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:10:04,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-27 15:10:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2022-04-27 15:10:04,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 268 transitions. [2022-04-27 15:10:04,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:04,253 INFO L225 Difference]: With dead ends: 1105 [2022-04-27 15:10:04,253 INFO L226 Difference]: Without dead ends: 747 [2022-04-27 15:10:04,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:04,254 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:04,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 154 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-27 15:10:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2022-04-27 15:10:04,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:04,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 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-27 15:10:04,266 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 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-27 15:10:04,266 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 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-27 15:10:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:04,282 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-27 15:10:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-27 15:10:04,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:04,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:04,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 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 747 states. [2022-04-27 15:10:04,285 INFO L87 Difference]: Start difference. First operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 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 747 states. [2022-04-27 15:10:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:04,301 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2022-04-27 15:10:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1304 transitions. [2022-04-27 15:10:04,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:04,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:04,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:04,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 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-27 15:10:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1303 transitions. [2022-04-27 15:10:04,318 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1303 transitions. Word has length 30 [2022-04-27 15:10:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:04,318 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 1303 transitions. [2022-04-27 15:10:04,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1303 transitions. [2022-04-27 15:10:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:10:04,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:04,319 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, 1, 1, 1, 1] [2022-04-27 15:10:04,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:10:04,319 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:04,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2029079313, now seen corresponding path program 1 times [2022-04-27 15:10:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:04,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534617225] [2022-04-27 15:10:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:04,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:04,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {18036#(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(18, 2);call #Ultimate.allocInit(12, 3); {18030#true} is VALID [2022-04-27 15:10:04,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {18030#true} assume true; {18030#true} is VALID [2022-04-27 15:10:04,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18030#true} {18030#true} #285#return; {18030#true} is VALID [2022-04-27 15:10:04,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {18030#true} call ULTIMATE.init(); {18036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:04,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {18036#(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(18, 2);call #Ultimate.allocInit(12, 3); {18030#true} is VALID [2022-04-27 15:10:04,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {18030#true} assume true; {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18030#true} {18030#true} #285#return; {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {18030#true} call #t~ret20 := main(); {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {18030#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {18030#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {18030#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {18030#true} assume !(0 != ~p1~0); {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {18030#true} assume !(0 != ~p2~0); {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {18030#true} assume !(0 != ~p3~0); {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {18030#true} assume !(0 != ~p4~0); {18030#true} is VALID [2022-04-27 15:10:04,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {18030#true} assume 0 != ~p5~0;~lk5~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {18035#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {18035#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {18035#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {18035#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {18035#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {18035#(= main_~lk5~0 1)} assume 0 != ~p5~0; {18035#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:04,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {18035#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {18031#false} is VALID [2022-04-27 15:10:04,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {18031#false} assume !false; {18031#false} is VALID [2022-04-27 15:10:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:04,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:04,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534617225] [2022-04-27 15:10:04,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534617225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:04,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:04,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:04,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317406005] [2022-04-27 15:10:04,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:04,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:10:04,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:04,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:04,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:04,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:04,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:04,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:04,380 INFO L87 Difference]: Start difference. First operand 745 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:04,621 INFO L93 Difference]: Finished difference Result 1389 states and 2465 transitions. [2022-04-27 15:10:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:10:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-27 15:10:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-27 15:10:04,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-27 15:10:04,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:04,786 INFO L225 Difference]: With dead ends: 1389 [2022-04-27 15:10:04,787 INFO L226 Difference]: Without dead ends: 1387 [2022-04-27 15:10:04,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:04,788 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:04,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 104 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-04-27 15:10:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1033. [2022-04-27 15:10:04,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:04,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 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-27 15:10:04,803 INFO L74 IsIncluded]: Start isIncluded. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 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-27 15:10:04,804 INFO L87 Difference]: Start difference. First operand 1387 states. Second operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 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-27 15:10:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:04,850 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-27 15:10:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-27 15:10:04,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:04,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:04,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 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 1387 states. [2022-04-27 15:10:04,854 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 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 1387 states. [2022-04-27 15:10:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:04,904 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2022-04-27 15:10:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2448 transitions. [2022-04-27 15:10:04,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:04,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:04,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:04,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 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-27 15:10:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1775 transitions. [2022-04-27 15:10:04,936 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1775 transitions. Word has length 30 [2022-04-27 15:10:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:04,936 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1775 transitions. [2022-04-27 15:10:04,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1775 transitions. [2022-04-27 15:10:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:10:04,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:04,937 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, 1, 1, 1, 1] [2022-04-27 15:10:04,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:10:04,938 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash 271743277, now seen corresponding path program 1 times [2022-04-27 15:10:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:04,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979461214] [2022-04-27 15:10:04,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:04,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:04,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:04,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {23306#(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(18, 2);call #Ultimate.allocInit(12, 3); {23300#true} is VALID [2022-04-27 15:10:04,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {23300#true} assume true; {23300#true} is VALID [2022-04-27 15:10:04,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23300#true} {23300#true} #285#return; {23300#true} is VALID [2022-04-27 15:10:04,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {23300#true} call ULTIMATE.init(); {23306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:04,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {23306#(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(18, 2);call #Ultimate.allocInit(12, 3); {23300#true} is VALID [2022-04-27 15:10:04,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {23300#true} assume true; {23300#true} is VALID [2022-04-27 15:10:04,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23300#true} {23300#true} #285#return; {23300#true} is VALID [2022-04-27 15:10:04,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {23300#true} call #t~ret20 := main(); {23300#true} is VALID [2022-04-27 15:10:04,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {23300#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {23300#true} is VALID [2022-04-27 15:10:04,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {23300#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {23300#true} is VALID [2022-04-27 15:10:04,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {23300#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {23300#true} is VALID [2022-04-27 15:10:05,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {23300#true} assume !(0 != ~p1~0); {23300#true} is VALID [2022-04-27 15:10:05,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {23300#true} assume !(0 != ~p2~0); {23300#true} is VALID [2022-04-27 15:10:05,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {23300#true} assume !(0 != ~p3~0); {23300#true} is VALID [2022-04-27 15:10:05,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {23300#true} assume !(0 != ~p4~0); {23300#true} is VALID [2022-04-27 15:10:05,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {23300#true} assume !(0 != ~p5~0); {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {23305#(= main_~p5~0 0)} assume !(0 != ~p10~0); {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {23305#(= main_~p5~0 0)} assume !(0 != ~p1~0); {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {23305#(= main_~p5~0 0)} assume !(0 != ~p2~0); {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {23305#(= main_~p5~0 0)} assume !(0 != ~p3~0); {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {23305#(= main_~p5~0 0)} assume !(0 != ~p4~0); {23305#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:05,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {23305#(= main_~p5~0 0)} assume 0 != ~p5~0; {23301#false} is VALID [2022-04-27 15:10:05,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {23301#false} assume 1 != ~lk5~0; {23301#false} is VALID [2022-04-27 15:10:05,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {23301#false} assume !false; {23301#false} is VALID [2022-04-27 15:10:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:05,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:05,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979461214] [2022-04-27 15:10:05,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979461214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:05,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:05,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753559109] [2022-04-27 15:10:05,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:05,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:10:05,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:05,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:05,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:05,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:05,022 INFO L87 Difference]: Start difference. First operand 1033 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:05,394 INFO L93 Difference]: Finished difference Result 2461 states and 4257 transitions. [2022-04-27 15:10:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:05,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2022-04-27 15:10:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-27 15:10:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2022-04-27 15:10:05,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 270 transitions. [2022-04-27 15:10:05,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:05,610 INFO L225 Difference]: With dead ends: 2461 [2022-04-27 15:10:05,610 INFO L226 Difference]: Without dead ends: 1451 [2022-04-27 15:10:05,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:05,612 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 199 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:05,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 143 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-27 15:10:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-27 15:10:05,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:05,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 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-27 15:10:05,652 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 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-27 15:10:05,654 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 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-27 15:10:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:05,705 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-27 15:10:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-27 15:10:05,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:05,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:05,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 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 1451 states. [2022-04-27 15:10:05,710 INFO L87 Difference]: Start difference. First operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 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 1451 states. [2022-04-27 15:10:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:05,765 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2022-04-27 15:10:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2488 transitions. [2022-04-27 15:10:05,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:05,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:05,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:05,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 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-27 15:10:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2487 transitions. [2022-04-27 15:10:05,822 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2487 transitions. Word has length 30 [2022-04-27 15:10:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:05,822 INFO L495 AbstractCegarLoop]: Abstraction has 1449 states and 2487 transitions. [2022-04-27 15:10:05,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:10:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2487 transitions. [2022-04-27 15:10:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:10:05,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:05,823 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, 1, 1, 1, 1, 1] [2022-04-27 15:10:05,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:10:05,823 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:05,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1523263864, now seen corresponding path program 1 times [2022-04-27 15:10:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:05,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705673512] [2022-04-27 15:10:05,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:05,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {30224#(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(18, 2);call #Ultimate.allocInit(12, 3); {30218#true} is VALID [2022-04-27 15:10:05,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {30218#true} assume true; {30218#true} is VALID [2022-04-27 15:10:05,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30218#true} {30218#true} #285#return; {30218#true} is VALID [2022-04-27 15:10:05,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {30218#true} call ULTIMATE.init(); {30224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:05,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {30224#(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(18, 2);call #Ultimate.allocInit(12, 3); {30218#true} is VALID [2022-04-27 15:10:05,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {30218#true} assume true; {30218#true} is VALID [2022-04-27 15:10:05,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30218#true} {30218#true} #285#return; {30218#true} is VALID [2022-04-27 15:10:05,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {30218#true} call #t~ret20 := main(); {30218#true} is VALID [2022-04-27 15:10:05,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {30218#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {30218#true} is VALID [2022-04-27 15:10:05,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {30218#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {30218#true} is VALID [2022-04-27 15:10:05,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {30218#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {30218#true} is VALID [2022-04-27 15:10:05,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {30218#true} assume !(0 != ~p1~0); {30218#true} is VALID [2022-04-27 15:10:05,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {30218#true} assume !(0 != ~p2~0); {30218#true} is VALID [2022-04-27 15:10:05,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {30218#true} assume !(0 != ~p3~0); {30218#true} is VALID [2022-04-27 15:10:05,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {30218#true} assume !(0 != ~p4~0); {30218#true} is VALID [2022-04-27 15:10:05,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {30218#true} assume 0 != ~p5~0;~lk5~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {30223#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {30223#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {30223#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {30223#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {30223#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {30223#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {30223#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {30223#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {30223#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {30223#(not (= main_~p5~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {30223#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {30223#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {30223#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {30223#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {30223#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:05,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {30223#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {30219#false} is VALID [2022-04-27 15:10:05,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {30219#false} assume 0 != ~p6~0; {30219#false} is VALID [2022-04-27 15:10:05,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {30219#false} assume 1 != ~lk6~0; {30219#false} is VALID [2022-04-27 15:10:05,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {30219#false} assume !false; {30219#false} is VALID [2022-04-27 15:10:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:05,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:05,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705673512] [2022-04-27 15:10:05,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705673512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:05,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:05,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244507108] [2022-04-27 15:10:05,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:05,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:05,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:05,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:05,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:05,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:05,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:05,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:05,885 INFO L87 Difference]: Start difference. First operand 1449 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:06,198 INFO L93 Difference]: Finished difference Result 2173 states and 3721 transitions. [2022-04-27 15:10:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-27 15:10:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-04-27 15:10:06,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 265 transitions. [2022-04-27 15:10:06,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:06,404 INFO L225 Difference]: With dead ends: 2173 [2022-04-27 15:10:06,405 INFO L226 Difference]: Without dead ends: 1467 [2022-04-27 15:10:06,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:06,406 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 192 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:06,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 151 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-04-27 15:10:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1465. [2022-04-27 15:10:06,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:06,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 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-27 15:10:06,426 INFO L74 IsIncluded]: Start isIncluded. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 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-27 15:10:06,427 INFO L87 Difference]: Start difference. First operand 1467 states. Second operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 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-27 15:10:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:06,477 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-27 15:10:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-27 15:10:06,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:06,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:06,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 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 1467 states. [2022-04-27 15:10:06,482 INFO L87 Difference]: Start difference. First operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 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 1467 states. [2022-04-27 15:10:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:06,534 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2022-04-27 15:10:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2488 transitions. [2022-04-27 15:10:06,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:06,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:06,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:06,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 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-27 15:10:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2487 transitions. [2022-04-27 15:10:06,591 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2487 transitions. Word has length 31 [2022-04-27 15:10:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:06,591 INFO L495 AbstractCegarLoop]: Abstraction has 1465 states and 2487 transitions. [2022-04-27 15:10:06,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2487 transitions. [2022-04-27 15:10:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:10:06,592 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:06,592 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, 1, 1, 1, 1, 1] [2022-04-27 15:10:06,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:10:06,592 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:06,593 INFO L85 PathProgramCache]: Analyzing trace with hash -165679878, now seen corresponding path program 1 times [2022-04-27 15:10:06,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:06,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368552215] [2022-04-27 15:10:06,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:06,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:06,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {36902#(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(18, 2);call #Ultimate.allocInit(12, 3); {36896#true} is VALID [2022-04-27 15:10:06,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {36896#true} assume true; {36896#true} is VALID [2022-04-27 15:10:06,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36896#true} {36896#true} #285#return; {36896#true} is VALID [2022-04-27 15:10:06,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {36896#true} call ULTIMATE.init(); {36902#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:06,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {36902#(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(18, 2);call #Ultimate.allocInit(12, 3); {36896#true} is VALID [2022-04-27 15:10:06,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {36896#true} assume true; {36896#true} is VALID [2022-04-27 15:10:06,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36896#true} {36896#true} #285#return; {36896#true} is VALID [2022-04-27 15:10:06,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {36896#true} call #t~ret20 := main(); {36896#true} is VALID [2022-04-27 15:10:06,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {36896#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {36896#true} is VALID [2022-04-27 15:10:06,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {36896#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {36896#true} is VALID [2022-04-27 15:10:06,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {36896#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {36896#true} is VALID [2022-04-27 15:10:06,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {36896#true} assume !(0 != ~p1~0); {36896#true} is VALID [2022-04-27 15:10:06,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {36896#true} assume !(0 != ~p2~0); {36896#true} is VALID [2022-04-27 15:10:06,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {36896#true} assume !(0 != ~p3~0); {36896#true} is VALID [2022-04-27 15:10:06,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {36896#true} assume !(0 != ~p4~0); {36896#true} is VALID [2022-04-27 15:10:06,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {36896#true} assume !(0 != ~p5~0); {36896#true} is VALID [2022-04-27 15:10:06,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {36896#true} assume 0 != ~p6~0;~lk6~0 := 1; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {36901#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {36901#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {36901#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {36901#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {36901#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {36901#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {36901#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {36901#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {36901#(= main_~lk6~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {36901#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {36901#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {36901#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {36901#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {36901#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {36901#(= main_~lk6~0 1)} assume 0 != ~p6~0; {36901#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:06,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {36901#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {36897#false} is VALID [2022-04-27 15:10:06,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {36897#false} assume !false; {36897#false} is VALID [2022-04-27 15:10:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:06,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368552215] [2022-04-27 15:10:06,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368552215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:06,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:06,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990816048] [2022-04-27 15:10:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:06,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:06,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:06,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:06,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:06,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:06,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:06,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:06,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:06,663 INFO L87 Difference]: Start difference. First operand 1465 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:07,036 INFO L93 Difference]: Finished difference Result 2701 states and 4665 transitions. [2022-04-27 15:10:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:07,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-27 15:10:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-27 15:10:07,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-27 15:10:07,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:07,357 INFO L225 Difference]: With dead ends: 2701 [2022-04-27 15:10:07,357 INFO L226 Difference]: Without dead ends: 2699 [2022-04-27 15:10:07,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:07,359 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:07,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 103 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-27 15:10:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2057. [2022-04-27 15:10:07,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:07,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 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-27 15:10:07,399 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 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-27 15:10:07,401 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 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-27 15:10:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:07,607 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-27 15:10:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-27 15:10:07,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:07,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:07,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 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 2699 states. [2022-04-27 15:10:07,614 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 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 2699 states. [2022-04-27 15:10:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:07,798 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2022-04-27 15:10:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4632 transitions. [2022-04-27 15:10:07,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:07,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:07,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:07,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 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-27 15:10:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3415 transitions. [2022-04-27 15:10:07,923 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3415 transitions. Word has length 31 [2022-04-27 15:10:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:07,923 INFO L495 AbstractCegarLoop]: Abstraction has 2057 states and 3415 transitions. [2022-04-27 15:10:07,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3415 transitions. [2022-04-27 15:10:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:10:07,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:07,925 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, 1, 1, 1, 1, 1] [2022-04-27 15:10:07,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:10:07,926 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:07,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142712, now seen corresponding path program 1 times [2022-04-27 15:10:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:07,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444424394] [2022-04-27 15:10:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:07,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {47180#(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(18, 2);call #Ultimate.allocInit(12, 3); {47174#true} is VALID [2022-04-27 15:10:07,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {47174#true} assume true; {47174#true} is VALID [2022-04-27 15:10:07,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47174#true} {47174#true} #285#return; {47174#true} is VALID [2022-04-27 15:10:07,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {47174#true} call ULTIMATE.init(); {47180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:07,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {47180#(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(18, 2);call #Ultimate.allocInit(12, 3); {47174#true} is VALID [2022-04-27 15:10:07,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {47174#true} assume true; {47174#true} is VALID [2022-04-27 15:10:07,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47174#true} {47174#true} #285#return; {47174#true} is VALID [2022-04-27 15:10:07,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {47174#true} call #t~ret20 := main(); {47174#true} is VALID [2022-04-27 15:10:07,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {47174#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {47174#true} is VALID [2022-04-27 15:10:07,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {47174#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {47174#true} is VALID [2022-04-27 15:10:07,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {47174#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {47174#true} is VALID [2022-04-27 15:10:07,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {47174#true} assume !(0 != ~p1~0); {47174#true} is VALID [2022-04-27 15:10:07,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {47174#true} assume !(0 != ~p2~0); {47174#true} is VALID [2022-04-27 15:10:07,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {47174#true} assume !(0 != ~p3~0); {47174#true} is VALID [2022-04-27 15:10:07,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {47174#true} assume !(0 != ~p4~0); {47174#true} is VALID [2022-04-27 15:10:07,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {47174#true} assume !(0 != ~p5~0); {47174#true} is VALID [2022-04-27 15:10:07,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {47174#true} assume !(0 != ~p6~0); {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {47179#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {47179#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {47179#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {47179#(= main_~p6~0 0)} assume !(0 != ~p10~0); {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {47179#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {47179#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {47179#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {47179#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {47179#(= main_~p6~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {47179#(= main_~p6~0 0)} assume !(0 != ~p1~0); {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {47179#(= main_~p6~0 0)} assume !(0 != ~p2~0); {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {47179#(= main_~p6~0 0)} assume !(0 != ~p3~0); {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {47179#(= main_~p6~0 0)} assume !(0 != ~p4~0); {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {47179#(= main_~p6~0 0)} assume !(0 != ~p5~0); {47179#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:07,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {47179#(= main_~p6~0 0)} assume 0 != ~p6~0; {47175#false} is VALID [2022-04-27 15:10:07,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {47175#false} assume 1 != ~lk6~0; {47175#false} is VALID [2022-04-27 15:10:07,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {47175#false} assume !false; {47175#false} is VALID [2022-04-27 15:10:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:07,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:07,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444424394] [2022-04-27 15:10:07,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444424394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:07,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:07,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915783299] [2022-04-27 15:10:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:07,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:07,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:07,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:07,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:07,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:07,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:07,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:08,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:08,000 INFO L87 Difference]: Start difference. First operand 2057 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:08,967 INFO L93 Difference]: Finished difference Result 4877 states and 8153 transitions. [2022-04-27 15:10:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-04-27 15:10:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-27 15:10:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2022-04-27 15:10:08,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 267 transitions. [2022-04-27 15:10:09,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:09,401 INFO L225 Difference]: With dead ends: 4877 [2022-04-27 15:10:09,401 INFO L226 Difference]: Without dead ends: 2859 [2022-04-27 15:10:09,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:09,404 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:09,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 145 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-04-27 15:10:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2022-04-27 15:10:09,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:09,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 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-27 15:10:09,444 INFO L74 IsIncluded]: Start isIncluded. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 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-27 15:10:09,446 INFO L87 Difference]: Start difference. First operand 2859 states. Second operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 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-27 15:10:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:09,654 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-27 15:10:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-27 15:10:09,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:09,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:09,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 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 2859 states. [2022-04-27 15:10:09,662 INFO L87 Difference]: Start difference. First operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 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 2859 states. [2022-04-27 15:10:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:09,907 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2022-04-27 15:10:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4744 transitions. [2022-04-27 15:10:09,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:09,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:09,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:09,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 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-27 15:10:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4743 transitions. [2022-04-27 15:10:10,171 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4743 transitions. Word has length 31 [2022-04-27 15:10:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:10,171 INFO L495 AbstractCegarLoop]: Abstraction has 2857 states and 4743 transitions. [2022-04-27 15:10:10,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-27 15:10:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4743 transitions. [2022-04-27 15:10:10,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:10:10,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:10,173 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, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:10,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:10:10,173 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:10,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:10,174 INFO L85 PathProgramCache]: Analyzing trace with hash -840895454, now seen corresponding path program 1 times [2022-04-27 15:10:10,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:10,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838367368] [2022-04-27 15:10:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:10,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:10,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {60818#(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(18, 2);call #Ultimate.allocInit(12, 3); {60812#true} is VALID [2022-04-27 15:10:10,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {60812#true} assume true; {60812#true} is VALID [2022-04-27 15:10:10,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60812#true} {60812#true} #285#return; {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {60812#true} call ULTIMATE.init(); {60818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:10,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {60818#(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(18, 2);call #Ultimate.allocInit(12, 3); {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {60812#true} assume true; {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60812#true} {60812#true} #285#return; {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {60812#true} call #t~ret20 := main(); {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {60812#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {60812#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {60812#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {60812#true} assume !(0 != ~p1~0); {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {60812#true} assume !(0 != ~p2~0); {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {60812#true} assume !(0 != ~p3~0); {60812#true} is VALID [2022-04-27 15:10:10,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {60812#true} assume !(0 != ~p4~0); {60812#true} is VALID [2022-04-27 15:10:10,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {60812#true} assume !(0 != ~p5~0); {60812#true} is VALID [2022-04-27 15:10:10,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {60812#true} assume 0 != ~p6~0;~lk6~0 := 1; {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {60817#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {60817#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {60817#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {60817#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {60817#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {60817#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {60817#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {60817#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {60817#(not (= main_~p6~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {60817#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {60817#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {60817#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {60817#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {60817#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {60817#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:10,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {60817#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {60813#false} is VALID [2022-04-27 15:10:10,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {60813#false} assume 0 != ~p7~0; {60813#false} is VALID [2022-04-27 15:10:10,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {60813#false} assume 1 != ~lk7~0; {60813#false} is VALID [2022-04-27 15:10:10,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {60813#false} assume !false; {60813#false} is VALID [2022-04-27 15:10:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:10,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:10,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838367368] [2022-04-27 15:10:10,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838367368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:10,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:10,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:10,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99394040] [2022-04-27 15:10:10,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:10,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:10:10,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:10,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:10,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:10,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:10,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:10,243 INFO L87 Difference]: Start difference. First operand 2857 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:10,921 INFO L93 Difference]: Finished difference Result 4285 states and 7097 transitions. [2022-04-27 15:10:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:10,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:10:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-27 15:10:10,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-27 15:10:10,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-27 15:10:11,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:11,305 INFO L225 Difference]: With dead ends: 4285 [2022-04-27 15:10:11,306 INFO L226 Difference]: Without dead ends: 2891 [2022-04-27 15:10:11,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:11,308 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:11,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:11,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-04-27 15:10:11,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2889. [2022-04-27 15:10:11,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:11,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 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-27 15:10:11,345 INFO L74 IsIncluded]: Start isIncluded. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 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-27 15:10:11,347 INFO L87 Difference]: Start difference. First operand 2891 states. Second operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 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-27 15:10:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:11,561 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-27 15:10:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-27 15:10:11,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:11,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:11,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 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 2891 states. [2022-04-27 15:10:11,569 INFO L87 Difference]: Start difference. First operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 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 2891 states. [2022-04-27 15:10:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:11,783 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2022-04-27 15:10:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4744 transitions. [2022-04-27 15:10:11,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:11,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:11,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:11,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 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-27 15:10:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4743 transitions. [2022-04-27 15:10:12,023 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4743 transitions. Word has length 32 [2022-04-27 15:10:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:12,023 INFO L495 AbstractCegarLoop]: Abstraction has 2889 states and 4743 transitions. [2022-04-27 15:10:12,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4743 transitions. [2022-04-27 15:10:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:10:12,025 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:12,025 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, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:12,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:10:12,025 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:12,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1765128100, now seen corresponding path program 1 times [2022-04-27 15:10:12,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:12,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608549455] [2022-04-27 15:10:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:12,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:12,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {73960#(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(18, 2);call #Ultimate.allocInit(12, 3); {73954#true} is VALID [2022-04-27 15:10:12,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {73954#true} assume true; {73954#true} is VALID [2022-04-27 15:10:12,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73954#true} {73954#true} #285#return; {73954#true} is VALID [2022-04-27 15:10:12,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {73954#true} call ULTIMATE.init(); {73960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:12,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {73960#(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(18, 2);call #Ultimate.allocInit(12, 3); {73954#true} is VALID [2022-04-27 15:10:12,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {73954#true} assume true; {73954#true} is VALID [2022-04-27 15:10:12,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73954#true} {73954#true} #285#return; {73954#true} is VALID [2022-04-27 15:10:12,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {73954#true} call #t~ret20 := main(); {73954#true} is VALID [2022-04-27 15:10:12,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {73954#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {73954#true} is VALID [2022-04-27 15:10:12,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {73954#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {73954#true} is VALID [2022-04-27 15:10:12,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {73954#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {73954#true} is VALID [2022-04-27 15:10:12,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {73954#true} assume !(0 != ~p1~0); {73954#true} is VALID [2022-04-27 15:10:12,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {73954#true} assume !(0 != ~p2~0); {73954#true} is VALID [2022-04-27 15:10:12,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {73954#true} assume !(0 != ~p3~0); {73954#true} is VALID [2022-04-27 15:10:12,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {73954#true} assume !(0 != ~p4~0); {73954#true} is VALID [2022-04-27 15:10:12,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {73954#true} assume !(0 != ~p5~0); {73954#true} is VALID [2022-04-27 15:10:12,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {73954#true} assume !(0 != ~p6~0); {73954#true} is VALID [2022-04-27 15:10:12,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {73954#true} assume 0 != ~p7~0;~lk7~0 := 1; {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {73959#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {73959#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {73959#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {73959#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {73959#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {73959#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {73959#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {73959#(= main_~lk7~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {73959#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {73959#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {73959#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {73959#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {73959#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {73959#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {73959#(= main_~lk7~0 1)} assume 0 != ~p7~0; {73959#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:12,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {73959#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {73955#false} is VALID [2022-04-27 15:10:12,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {73955#false} assume !false; {73955#false} is VALID [2022-04-27 15:10:12,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-27 15:10:12,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:12,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608549455] [2022-04-27 15:10:12,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608549455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:12,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:12,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:12,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689822869] [2022-04-27 15:10:12,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:12,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:10:12,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:12,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:12,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:12,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:12,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:12,088 INFO L87 Difference]: Start difference. First operand 2889 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:13,055 INFO L93 Difference]: Finished difference Result 5261 states and 8809 transitions. [2022-04-27 15:10:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:13,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:10:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-27 15:10:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-27 15:10:13,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-27 15:10:13,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:13,979 INFO L225 Difference]: With dead ends: 5261 [2022-04-27 15:10:13,979 INFO L226 Difference]: Without dead ends: 5259 [2022-04-27 15:10:13,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:13,981 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 211 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:13,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-27 15:10:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4105. [2022-04-27 15:10:14,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:14,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 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-27 15:10:14,037 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 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-27 15:10:14,040 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 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-27 15:10:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:14,784 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-27 15:10:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-27 15:10:14,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:14,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:14,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 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 5259 states. [2022-04-27 15:10:14,795 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 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 5259 states. [2022-04-27 15:10:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:15,480 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2022-04-27 15:10:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8744 transitions. [2022-04-27 15:10:15,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:15,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:15,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:15,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 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-27 15:10:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6567 transitions. [2022-04-27 15:10:15,960 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6567 transitions. Word has length 32 [2022-04-27 15:10:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:15,960 INFO L495 AbstractCegarLoop]: Abstraction has 4105 states and 6567 transitions. [2022-04-27 15:10:15,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6567 transitions. [2022-04-27 15:10:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:10:15,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:15,963 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, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:15,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:10:15,963 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash -229016606, now seen corresponding path program 1 times [2022-04-27 15:10:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:15,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773139760] [2022-04-27 15:10:15,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:15,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:15,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {94062#(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(18, 2);call #Ultimate.allocInit(12, 3); {94056#true} is VALID [2022-04-27 15:10:15,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {94056#true} assume true; {94056#true} is VALID [2022-04-27 15:10:15,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94056#true} {94056#true} #285#return; {94056#true} is VALID [2022-04-27 15:10:15,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {94056#true} call ULTIMATE.init(); {94062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:15,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {94062#(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(18, 2);call #Ultimate.allocInit(12, 3); {94056#true} is VALID [2022-04-27 15:10:15,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {94056#true} assume true; {94056#true} is VALID [2022-04-27 15:10:15,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94056#true} {94056#true} #285#return; {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {94056#true} call #t~ret20 := main(); {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {94056#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {94056#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {94056#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {94056#true} assume !(0 != ~p1~0); {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {94056#true} assume !(0 != ~p2~0); {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {94056#true} assume !(0 != ~p3~0); {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {94056#true} assume !(0 != ~p4~0); {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {94056#true} assume !(0 != ~p5~0); {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {94056#true} assume !(0 != ~p6~0); {94056#true} is VALID [2022-04-27 15:10:15,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {94056#true} assume !(0 != ~p7~0); {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {94061#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {94061#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {94061#(= main_~p7~0 0)} assume !(0 != ~p10~0); {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {94061#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {94061#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {94061#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {94061#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {94061#(= main_~p7~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {94061#(= main_~p7~0 0)} assume !(0 != ~p1~0); {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {94061#(= main_~p7~0 0)} assume !(0 != ~p2~0); {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {94061#(= main_~p7~0 0)} assume !(0 != ~p3~0); {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {94061#(= main_~p7~0 0)} assume !(0 != ~p4~0); {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {94061#(= main_~p7~0 0)} assume !(0 != ~p5~0); {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {94061#(= main_~p7~0 0)} assume !(0 != ~p6~0); {94061#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:15,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {94061#(= main_~p7~0 0)} assume 0 != ~p7~0; {94057#false} is VALID [2022-04-27 15:10:15,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {94057#false} assume 1 != ~lk7~0; {94057#false} is VALID [2022-04-27 15:10:15,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {94057#false} assume !false; {94057#false} is VALID [2022-04-27 15:10:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:15,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:15,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773139760] [2022-04-27 15:10:15,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773139760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:15,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:15,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613374945] [2022-04-27 15:10:15,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:10:15,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:15,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:16,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:16,008 INFO L87 Difference]: Start difference. First operand 4105 states and 6567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,785 INFO L93 Difference]: Finished difference Result 9677 states and 15593 transitions. [2022-04-27 15:10:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-27 15:10:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-27 15:10:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-27 15:10:18,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-27 15:10:18,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:19,834 INFO L225 Difference]: With dead ends: 9677 [2022-04-27 15:10:19,834 INFO L226 Difference]: Without dead ends: 5643 [2022-04-27 15:10:19,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:19,837 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:19,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 147 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-27 15:10:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5641. [2022-04-27 15:10:19,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:19,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 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-27 15:10:19,908 INFO L74 IsIncluded]: Start isIncluded. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 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-27 15:10:19,911 INFO L87 Difference]: Start difference. First operand 5643 states. Second operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 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-27 15:10:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:20,780 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-27 15:10:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-27 15:10:20,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:20,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:20,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 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 5643 states. [2022-04-27 15:10:20,794 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 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 5643 states. [2022-04-27 15:10:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:21,548 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2022-04-27 15:10:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 9032 transitions. [2022-04-27 15:10:21,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:21,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:21,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:21,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 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-27 15:10:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9031 transitions. [2022-04-27 15:10:22,452 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9031 transitions. Word has length 32 [2022-04-27 15:10:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:22,453 INFO L495 AbstractCegarLoop]: Abstraction has 5641 states and 9031 transitions. [2022-04-27 15:10:22,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-27 15:10:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9031 transitions. [2022-04-27 15:10:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:10:22,455 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:22,455 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:22,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:10:22,455 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:22,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1115389939, now seen corresponding path program 1 times [2022-04-27 15:10:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:22,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661175933] [2022-04-27 15:10:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:22,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:22,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {121012#(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(18, 2);call #Ultimate.allocInit(12, 3); {121006#true} is VALID [2022-04-27 15:10:22,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {121006#true} assume true; {121006#true} is VALID [2022-04-27 15:10:22,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121006#true} {121006#true} #285#return; {121006#true} is VALID [2022-04-27 15:10:22,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {121006#true} call ULTIMATE.init(); {121012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:22,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {121012#(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(18, 2);call #Ultimate.allocInit(12, 3); {121006#true} is VALID [2022-04-27 15:10:22,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {121006#true} assume true; {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121006#true} {121006#true} #285#return; {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {121006#true} call #t~ret20 := main(); {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {121006#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {121006#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {121006#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {121006#true} assume !(0 != ~p1~0); {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {121006#true} assume !(0 != ~p2~0); {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {121006#true} assume !(0 != ~p3~0); {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {121006#true} assume !(0 != ~p4~0); {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {121006#true} assume !(0 != ~p5~0); {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {121006#true} assume !(0 != ~p6~0); {121006#true} is VALID [2022-04-27 15:10:22,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {121006#true} assume 0 != ~p7~0;~lk7~0 := 1; {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {121011#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {121011#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {121011#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {121011#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {121011#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {121011#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {121011#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {121011#(not (= main_~p7~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {121011#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {121011#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {121011#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {121011#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {121011#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {121011#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {121011#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:22,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {121011#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {121007#false} is VALID [2022-04-27 15:10:22,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {121007#false} assume 0 != ~p8~0; {121007#false} is VALID [2022-04-27 15:10:22,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {121007#false} assume 1 != ~lk8~0; {121007#false} is VALID [2022-04-27 15:10:22,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {121007#false} assume !false; {121007#false} is VALID [2022-04-27 15:10:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:22,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:22,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661175933] [2022-04-27 15:10:22,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661175933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:22,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:22,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:22,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710098822] [2022-04-27 15:10:22,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:22,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2022-04-27 15:10:22,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:22,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:22,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:22,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:22,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:22,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:22,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:22,513 INFO L87 Difference]: Start difference. First operand 5641 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,830 INFO L93 Difference]: Finished difference Result 8461 states and 13513 transitions. [2022-04-27 15:10:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:24,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2022-04-27 15:10:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-27 15:10:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-27 15:10:24,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-27 15:10:25,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,929 INFO L225 Difference]: With dead ends: 8461 [2022-04-27 15:10:25,929 INFO L226 Difference]: Without dead ends: 5707 [2022-04-27 15:10:25,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:25,932 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:25,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 145 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2022-04-27 15:10:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5705. [2022-04-27 15:10:25,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:25,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 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-27 15:10:25,997 INFO L74 IsIncluded]: Start isIncluded. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 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-27 15:10:26,002 INFO L87 Difference]: Start difference. First operand 5707 states. Second operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 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-27 15:10:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,883 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-27 15:10:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-27 15:10:26,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 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 5707 states. [2022-04-27 15:10:26,895 INFO L87 Difference]: Start difference. First operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 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 5707 states. [2022-04-27 15:10:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,792 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2022-04-27 15:10:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 9032 transitions. [2022-04-27 15:10:27,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:27,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 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-27 15:10:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 9031 transitions. [2022-04-27 15:10:28,756 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 9031 transitions. Word has length 33 [2022-04-27 15:10:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:28,756 INFO L495 AbstractCegarLoop]: Abstraction has 5705 states and 9031 transitions. [2022-04-27 15:10:28,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 9031 transitions. [2022-04-27 15:10:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:10:28,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:28,758 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:28,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:10:28,758 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:28,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1490633615, now seen corresponding path program 1 times [2022-04-27 15:10:28,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:28,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212925224] [2022-04-27 15:10:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {146938#(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(18, 2);call #Ultimate.allocInit(12, 3); {146932#true} is VALID [2022-04-27 15:10:28,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {146932#true} assume true; {146932#true} is VALID [2022-04-27 15:10:28,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146932#true} {146932#true} #285#return; {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {146932#true} call ULTIMATE.init(); {146938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {146938#(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(18, 2);call #Ultimate.allocInit(12, 3); {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {146932#true} assume true; {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146932#true} {146932#true} #285#return; {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {146932#true} call #t~ret20 := main(); {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {146932#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {146932#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {146932#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {146932#true} assume !(0 != ~p1~0); {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {146932#true} assume !(0 != ~p2~0); {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {146932#true} assume !(0 != ~p3~0); {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {146932#true} assume !(0 != ~p4~0); {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {146932#true} assume !(0 != ~p5~0); {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {146932#true} assume !(0 != ~p6~0); {146932#true} is VALID [2022-04-27 15:10:28,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {146932#true} assume !(0 != ~p7~0); {146932#true} is VALID [2022-04-27 15:10:28,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {146932#true} assume 0 != ~p8~0;~lk8~0 := 1; {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {146937#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {146937#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {146937#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {146937#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {146937#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {146937#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {146937#(= main_~lk8~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {146937#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {146937#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {146937#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {146937#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {146937#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {146937#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {146937#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {146937#(= main_~lk8~0 1)} assume 0 != ~p8~0; {146937#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:28,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {146937#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {146933#false} is VALID [2022-04-27 15:10:28,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {146933#false} assume !false; {146933#false} is VALID [2022-04-27 15:10:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212925224] [2022-04-27 15:10:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212925224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:28,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:28,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105657243] [2022-04-27 15:10:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:28,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2022-04-27 15:10:28,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:28,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:28,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:28,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:28,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:28,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:28,809 INFO L87 Difference]: Start difference. First operand 5705 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:31,971 INFO L93 Difference]: Finished difference Result 10253 states and 16585 transitions. [2022-04-27 15:10:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2022-04-27 15:10:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:10:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:10:31,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-27 15:10:32,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:34,760 INFO L225 Difference]: With dead ends: 10253 [2022-04-27 15:10:34,760 INFO L226 Difference]: Without dead ends: 10251 [2022-04-27 15:10:34,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:34,761 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 204 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:34,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 101 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2022-04-27 15:10:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8201. [2022-04-27 15:10:34,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:34,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 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-27 15:10:34,854 INFO L74 IsIncluded]: Start isIncluded. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 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-27 15:10:34,863 INFO L87 Difference]: Start difference. First operand 10251 states. Second operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 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-27 15:10:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:37,698 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-27 15:10:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-27 15:10:37,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:37,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:37,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 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 10251 states. [2022-04-27 15:10:37,745 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 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 10251 states. [2022-04-27 15:10:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:40,807 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2022-04-27 15:10:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 16456 transitions. [2022-04-27 15:10:40,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:40,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:40,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:40,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 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-27 15:10:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12615 transitions. [2022-04-27 15:10:42,909 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12615 transitions. Word has length 33 [2022-04-27 15:10:42,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:42,909 INFO L495 AbstractCegarLoop]: Abstraction has 8201 states and 12615 transitions. [2022-04-27 15:10:42,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12615 transitions. [2022-04-27 15:10:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:10:42,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:42,912 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:42,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:10:42,913 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -503511091, now seen corresponding path program 1 times [2022-04-27 15:10:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929787420] [2022-04-27 15:10:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:42,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:42,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {186304#(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(18, 2);call #Ultimate.allocInit(12, 3); {186298#true} is VALID [2022-04-27 15:10:42,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {186298#true} assume true; {186298#true} is VALID [2022-04-27 15:10:42,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186298#true} {186298#true} #285#return; {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {186298#true} call ULTIMATE.init(); {186304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:42,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {186304#(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(18, 2);call #Ultimate.allocInit(12, 3); {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {186298#true} assume true; {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186298#true} {186298#true} #285#return; {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {186298#true} call #t~ret20 := main(); {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {186298#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {186298#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {186298#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {186298#true} assume !(0 != ~p1~0); {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {186298#true} assume !(0 != ~p2~0); {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {186298#true} assume !(0 != ~p3~0); {186298#true} is VALID [2022-04-27 15:10:42,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {186298#true} assume !(0 != ~p4~0); {186298#true} is VALID [2022-04-27 15:10:42,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {186298#true} assume !(0 != ~p5~0); {186298#true} is VALID [2022-04-27 15:10:42,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {186298#true} assume !(0 != ~p6~0); {186298#true} is VALID [2022-04-27 15:10:42,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {186298#true} assume !(0 != ~p7~0); {186298#true} is VALID [2022-04-27 15:10:42,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {186298#true} assume !(0 != ~p8~0); {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {186303#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {186303#(= main_~p8~0 0)} assume !(0 != ~p10~0); {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {186303#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {186303#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {186303#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {186303#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {186303#(= main_~p8~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {186303#(= main_~p8~0 0)} assume !(0 != ~p1~0); {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {186303#(= main_~p8~0 0)} assume !(0 != ~p2~0); {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {186303#(= main_~p8~0 0)} assume !(0 != ~p3~0); {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {186303#(= main_~p8~0 0)} assume !(0 != ~p4~0); {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {186303#(= main_~p8~0 0)} assume !(0 != ~p5~0); {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {186303#(= main_~p8~0 0)} assume !(0 != ~p6~0); {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {186303#(= main_~p8~0 0)} assume !(0 != ~p7~0); {186303#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:42,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {186303#(= main_~p8~0 0)} assume 0 != ~p8~0; {186299#false} is VALID [2022-04-27 15:10:42,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {186299#false} assume 1 != ~lk8~0; {186299#false} is VALID [2022-04-27 15:10:42,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {186299#false} assume !false; {186299#false} is VALID [2022-04-27 15:10:42,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-27 15:10:42,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:42,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929787420] [2022-04-27 15:10:42,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929787420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:42,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:42,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:42,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175876541] [2022-04-27 15:10:42,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2022-04-27 15:10:42,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:42,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:42,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:42,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:42,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:42,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:42,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:42,967 INFO L87 Difference]: Start difference. First operand 8201 states and 12615 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:52,771 INFO L93 Difference]: Finished difference Result 19213 states and 29769 transitions. [2022-04-27 15:10:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:52,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2022-04-27 15:10:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-27 15:10:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:10:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2022-04-27 15:10:52,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 261 transitions. [2022-04-27 15:10:52,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:56,597 INFO L225 Difference]: With dead ends: 19213 [2022-04-27 15:10:56,597 INFO L226 Difference]: Without dead ends: 11147 [2022-04-27 15:10:56,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:56,603 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:56,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2022-04-27 15:10:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 11145. [2022-04-27 15:10:56,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:56,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 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-27 15:10:56,747 INFO L74 IsIncluded]: Start isIncluded. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 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-27 15:10:56,758 INFO L87 Difference]: Start difference. First operand 11147 states. Second operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 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-27 15:11:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:00,068 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-27 15:11:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-27 15:11:00,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:00,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:00,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 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 11147 states. [2022-04-27 15:11:00,102 INFO L87 Difference]: Start difference. First operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 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 11147 states. [2022-04-27 15:11:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:03,412 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2022-04-27 15:11:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 17160 transitions. [2022-04-27 15:11:03,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:03,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:03,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:03,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 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-27 15:11:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 17159 transitions. [2022-04-27 15:11:06,576 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 17159 transitions. Word has length 33 [2022-04-27 15:11:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:06,576 INFO L495 AbstractCegarLoop]: Abstraction has 11145 states and 17159 transitions. [2022-04-27 15:11:06,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:11:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 17159 transitions. [2022-04-27 15:11:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 15:11:06,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:11:06,580 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:11:06,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:11:06,580 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:11:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:11:06,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1034784041, now seen corresponding path program 1 times [2022-04-27 15:11:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:11:06,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259662581] [2022-04-27 15:11:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:11:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:11:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:11:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:06,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {239622#(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(18, 2);call #Ultimate.allocInit(12, 3); {239616#true} is VALID [2022-04-27 15:11:06,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {239616#true} assume true; {239616#true} is VALID [2022-04-27 15:11:06,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {239616#true} {239616#true} #285#return; {239616#true} is VALID [2022-04-27 15:11:06,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {239616#true} call ULTIMATE.init(); {239622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {239622#(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(18, 2);call #Ultimate.allocInit(12, 3); {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {239616#true} assume true; {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239616#true} {239616#true} #285#return; {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {239616#true} call #t~ret20 := main(); {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {239616#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {239616#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {239616#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {239616#true} assume !(0 != ~p1~0); {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {239616#true} assume !(0 != ~p2~0); {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {239616#true} assume !(0 != ~p3~0); {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {239616#true} assume !(0 != ~p4~0); {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {239616#true} assume !(0 != ~p5~0); {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {239616#true} assume !(0 != ~p6~0); {239616#true} is VALID [2022-04-27 15:11:06,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {239616#true} assume !(0 != ~p7~0); {239616#true} is VALID [2022-04-27 15:11:06,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {239616#true} assume 0 != ~p8~0;~lk8~0 := 1; {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {239621#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {239621#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {239621#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {239621#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {239621#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {239621#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {239621#(not (= main_~p8~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {239621#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {239621#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {239621#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {239621#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {239621#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {239621#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {239621#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {239621#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:11:06,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {239621#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {239617#false} is VALID [2022-04-27 15:11:06,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {239617#false} assume 0 != ~p9~0; {239617#false} is VALID [2022-04-27 15:11:06,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {239617#false} assume 1 != ~lk9~0; {239617#false} is VALID [2022-04-27 15:11:06,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {239617#false} assume !false; {239617#false} is VALID [2022-04-27 15:11:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:11:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:11:06,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259662581] [2022-04-27 15:11:06,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259662581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:11:06,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:11:06,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:11:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220346293] [2022-04-27 15:11:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:11:06,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2022-04-27 15:11:06,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:11:06,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:11:06,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:06,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:11:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:11:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:11:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:11:06,647 INFO L87 Difference]: Start difference. First operand 11145 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:11:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:14,424 INFO L93 Difference]: Finished difference Result 16717 states and 25673 transitions. [2022-04-27 15:11:14,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:11:14,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2022-04-27 15:11:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:11:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:11:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-27 15:11:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:11:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-27 15:11:14,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 256 transitions. [2022-04-27 15:11:14,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:19,538 INFO L225 Difference]: With dead ends: 16717 [2022-04-27 15:11:19,538 INFO L226 Difference]: Without dead ends: 11275 [2022-04-27 15:11:19,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:11:19,544 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:11:19,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 142 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:11:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2022-04-27 15:11:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11273. [2022-04-27 15:11:19,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:11:19,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 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-27 15:11:19,729 INFO L74 IsIncluded]: Start isIncluded. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 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-27 15:11:19,744 INFO L87 Difference]: Start difference. First operand 11275 states. Second operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 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-27 15:11:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:23,156 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-27 15:11:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-27 15:11:23,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:23,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:23,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 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 11275 states. [2022-04-27 15:11:23,182 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 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 11275 states. [2022-04-27 15:11:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:26,533 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2022-04-27 15:11:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 17160 transitions. [2022-04-27 15:11:26,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:26,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:26,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:26,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 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-27 15:11:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 17159 transitions. [2022-04-27 15:11:29,817 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 17159 transitions. Word has length 34 [2022-04-27 15:11:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:29,817 INFO L495 AbstractCegarLoop]: Abstraction has 11273 states and 17159 transitions. [2022-04-27 15:11:29,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:11:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 17159 transitions. [2022-04-27 15:11:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 15:11:29,821 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:11:29,821 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:11:29,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:11:29,821 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:11:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:11:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1571239513, now seen corresponding path program 1 times [2022-04-27 15:11:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:11:29,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614271614] [2022-04-27 15:11:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:11:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:11:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:11:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:29,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {290828#(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(18, 2);call #Ultimate.allocInit(12, 3); {290822#true} is VALID [2022-04-27 15:11:29,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {290822#true} assume true; {290822#true} is VALID [2022-04-27 15:11:29,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {290822#true} {290822#true} #285#return; {290822#true} is VALID [2022-04-27 15:11:29,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {290822#true} call ULTIMATE.init(); {290828#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:11:29,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {290828#(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(18, 2);call #Ultimate.allocInit(12, 3); {290822#true} is VALID [2022-04-27 15:11:29,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {290822#true} assume true; {290822#true} is VALID [2022-04-27 15:11:29,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {290822#true} {290822#true} #285#return; {290822#true} is VALID [2022-04-27 15:11:29,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {290822#true} call #t~ret20 := main(); {290822#true} is VALID [2022-04-27 15:11:29,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {290822#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {290822#true} is VALID [2022-04-27 15:11:29,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {290822#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {290822#true} is VALID [2022-04-27 15:11:29,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {290822#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {290822#true} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {290822#true} assume !(0 != ~p1~0); {290822#true} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {290822#true} assume !(0 != ~p2~0); {290822#true} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {290822#true} assume !(0 != ~p3~0); {290822#true} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {290822#true} assume !(0 != ~p4~0); {290822#true} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {290822#true} assume !(0 != ~p5~0); {290822#true} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {290822#true} assume !(0 != ~p6~0); {290822#true} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {290822#true} assume !(0 != ~p7~0); {290822#true} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {290822#true} assume !(0 != ~p8~0); {290822#true} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {290822#true} assume 0 != ~p9~0;~lk9~0 := 1; {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {290827#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {290827#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {290827#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {290827#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {290827#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {290827#(= main_~lk9~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {290827#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {290827#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {290827#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {290827#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {290827#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {290827#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {290827#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {290827#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {290827#(= main_~lk9~0 1)} assume 0 != ~p9~0; {290827#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:29,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {290827#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {290823#false} is VALID [2022-04-27 15:11:29,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {290823#false} assume !false; {290823#false} is VALID [2022-04-27 15:11:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:11:29,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:11:29,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614271614] [2022-04-27 15:11:29,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614271614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:11:29,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:11:29,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:11:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92681119] [2022-04-27 15:11:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:11:29,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2022-04-27 15:11:29,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:11:29,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:11:29,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:29,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:11:29,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:11:29,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:11:29,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:11:29,896 INFO L87 Difference]: Start difference. First operand 11273 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:11:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:40,504 INFO L93 Difference]: Finished difference Result 19981 states and 31113 transitions. [2022-04-27 15:11:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:11:40,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2022-04-27 15:11:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:11:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:11:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:11:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:11:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:11:40,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-27 15:11:40,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:51,125 INFO L225 Difference]: With dead ends: 19981 [2022-04-27 15:11:51,126 INFO L226 Difference]: Without dead ends: 19979 [2022-04-27 15:11:51,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:11:51,128 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:11:51,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:11:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19979 states. [2022-04-27 15:11:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19979 to 16393. [2022-04-27 15:11:51,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:11:51,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 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-27 15:11:51,305 INFO L74 IsIncluded]: Start isIncluded. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 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-27 15:11:51,323 INFO L87 Difference]: Start difference. First operand 19979 states. Second operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 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-27 15:12:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:02,284 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-27 15:12:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-27 15:12:02,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:12:02,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:12:02,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 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 19979 states. [2022-04-27 15:12:02,331 INFO L87 Difference]: Start difference. First operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 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 19979 states. [2022-04-27 15:12:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:13,027 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2022-04-27 15:12:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 30856 transitions. [2022-04-27 15:12:13,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:12:13,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:12:13,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:12:13,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:12:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 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-27 15:12:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 24199 transitions. [2022-04-27 15:12:19,914 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 24199 transitions. Word has length 34 [2022-04-27 15:12:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:12:19,914 INFO L495 AbstractCegarLoop]: Abstraction has 16393 states and 24199 transitions. [2022-04-27 15:12:19,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:12:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 24199 transitions. [2022-04-27 15:12:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 15:12:19,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:12:19,921 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:12:19,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:12:19,921 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:12:19,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:12:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash -422905193, now seen corresponding path program 1 times [2022-04-27 15:12:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:12:19,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277051320] [2022-04-27 15:12:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:12:19,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:12:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:12:19,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:12:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:12:19,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {367954#(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(18, 2);call #Ultimate.allocInit(12, 3); {367948#true} is VALID [2022-04-27 15:12:19,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {367948#true} assume true; {367948#true} is VALID [2022-04-27 15:12:19,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367948#true} {367948#true} #285#return; {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {367948#true} call ULTIMATE.init(); {367954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {367954#(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(18, 2);call #Ultimate.allocInit(12, 3); {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {367948#true} assume true; {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367948#true} {367948#true} #285#return; {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {367948#true} call #t~ret20 := main(); {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {367948#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {367948#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {367948#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {367948#true} assume !(0 != ~p1~0); {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {367948#true} assume !(0 != ~p2~0); {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {367948#true} assume !(0 != ~p3~0); {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {367948#true} assume !(0 != ~p4~0); {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {367948#true} assume !(0 != ~p5~0); {367948#true} is VALID [2022-04-27 15:12:19,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {367948#true} assume !(0 != ~p6~0); {367948#true} is VALID [2022-04-27 15:12:19,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {367948#true} assume !(0 != ~p7~0); {367948#true} is VALID [2022-04-27 15:12:19,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {367948#true} assume !(0 != ~p8~0); {367948#true} is VALID [2022-04-27 15:12:19,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {367948#true} assume !(0 != ~p9~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {367953#(= main_~p9~0 0)} assume !(0 != ~p10~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {367953#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {367953#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {367953#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {367953#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {367953#(= main_~p9~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {367953#(= main_~p9~0 0)} assume !(0 != ~p1~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {367953#(= main_~p9~0 0)} assume !(0 != ~p2~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {367953#(= main_~p9~0 0)} assume !(0 != ~p3~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {367953#(= main_~p9~0 0)} assume !(0 != ~p4~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {367953#(= main_~p9~0 0)} assume !(0 != ~p5~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {367953#(= main_~p9~0 0)} assume !(0 != ~p6~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {367953#(= main_~p9~0 0)} assume !(0 != ~p7~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {367953#(= main_~p9~0 0)} assume !(0 != ~p8~0); {367953#(= main_~p9~0 0)} is VALID [2022-04-27 15:12:19,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {367953#(= main_~p9~0 0)} assume 0 != ~p9~0; {367949#false} is VALID [2022-04-27 15:12:19,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {367949#false} assume 1 != ~lk9~0; {367949#false} is VALID [2022-04-27 15:12:19,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {367949#false} assume !false; {367949#false} is VALID [2022-04-27 15:12:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:12:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:12:19,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277051320] [2022-04-27 15:12:19,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277051320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:12:19,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:12:19,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:12:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433590298] [2022-04-27 15:12:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:12:19,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2022-04-27 15:12:19,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:12:19,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:12:19,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:12:19,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:12:19,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:12:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:12:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:12:19,978 INFO L87 Difference]: Start difference. First operand 16393 states and 24199 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:13:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:09,428 INFO L93 Difference]: Finished difference Result 38157 states and 56713 transitions. [2022-04-27 15:13:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:13:09,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2022-04-27 15:13:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:13:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:13:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-27 15:13:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:13:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-27 15:13:09,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-27 15:13:09,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:13:25,042 INFO L225 Difference]: With dead ends: 38157 [2022-04-27 15:13:25,043 INFO L226 Difference]: Without dead ends: 22027 [2022-04-27 15:13:25,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:13:25,059 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:13:25,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 151 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:13:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22027 states. [2022-04-27 15:13:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22027 to 22025. [2022-04-27 15:13:25,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:13:25,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 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-27 15:13:25,393 INFO L74 IsIncluded]: Start isIncluded. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 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-27 15:13:25,463 INFO L87 Difference]: Start difference. First operand 22027 states. Second operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 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-27 15:13:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:40,046 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-27 15:13:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-27 15:13:40,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:40,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:13:40,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 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 22027 states. [2022-04-27 15:13:40,124 INFO L87 Difference]: Start difference. First operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 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 22027 states. [2022-04-27 15:13:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:53,503 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2022-04-27 15:13:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 32520 transitions. [2022-04-27 15:13:53,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:53,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:13:53,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:13:53,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:13:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 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-27 15:14:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 32519 transitions. [2022-04-27 15:14:06,259 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 32519 transitions. Word has length 34 [2022-04-27 15:14:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:14:06,259 INFO L495 AbstractCegarLoop]: Abstraction has 22025 states and 32519 transitions. [2022-04-27 15:14:06,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-27 15:14:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 32519 transitions. [2022-04-27 15:14:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 15:14:06,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:14:06,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:14:06,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:14:06,267 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:14:06,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:14:06,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1463999138, now seen corresponding path program 1 times [2022-04-27 15:14:06,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:14:06,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362662233] [2022-04-27 15:14:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:14:06,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:14:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:14:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:14:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:14:06,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {473496#(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(18, 2);call #Ultimate.allocInit(12, 3); {473490#true} is VALID [2022-04-27 15:14:06,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {473490#true} assume true; {473490#true} is VALID [2022-04-27 15:14:06,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {473490#true} {473490#true} #285#return; {473490#true} is VALID [2022-04-27 15:14:06,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {473490#true} call ULTIMATE.init(); {473496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:14:06,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {473496#(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(18, 2);call #Ultimate.allocInit(12, 3); {473490#true} is VALID [2022-04-27 15:14:06,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {473490#true} assume true; {473490#true} is VALID [2022-04-27 15:14:06,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {473490#true} {473490#true} #285#return; {473490#true} is VALID [2022-04-27 15:14:06,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {473490#true} call #t~ret20 := main(); {473490#true} is VALID [2022-04-27 15:14:06,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {473490#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {473490#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {473490#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {473490#true} assume !(0 != ~p1~0); {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {473490#true} assume !(0 != ~p2~0); {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {473490#true} assume !(0 != ~p3~0); {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {473490#true} assume !(0 != ~p4~0); {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {473490#true} assume !(0 != ~p5~0); {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {473490#true} assume !(0 != ~p6~0); {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {473490#true} assume !(0 != ~p7~0); {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {473490#true} assume !(0 != ~p8~0); {473490#true} is VALID [2022-04-27 15:14:06,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {473490#true} assume 0 != ~p9~0;~lk9~0 := 1; {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {473495#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {473495#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {473495#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {473495#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {473495#(not (= main_~p9~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {473495#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:14:06,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {473495#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {473491#false} is VALID [2022-04-27 15:14:06,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {473491#false} assume 0 != ~p10~0; {473491#false} is VALID [2022-04-27 15:14:06,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {473491#false} assume 1 != ~lk10~0; {473491#false} is VALID [2022-04-27 15:14:06,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {473491#false} assume !false; {473491#false} is VALID [2022-04-27 15:14:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:14:06,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:14:06,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362662233] [2022-04-27 15:14:06,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362662233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:14:06,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:14:06,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:14:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104762666] [2022-04-27 15:14:06,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:14:06,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 35 [2022-04-27 15:14:06,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:14:06,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:14:06,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:14:06,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:14:06,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:14:06,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:14:06,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:14:06,332 INFO L87 Difference]: Start difference. First operand 22025 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:14:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:14:36,253 INFO L93 Difference]: Finished difference Result 33037 states and 48649 transitions. [2022-04-27 15:14:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:14:36,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 35 [2022-04-27 15:14:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:14:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:14:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-27 15:14:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:14:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-27 15:14:36,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-27 15:14:36,394 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-27 15:14:50,081 INFO L225 Difference]: With dead ends: 33037 [2022-04-27 15:14:50,081 INFO L226 Difference]: Without dead ends: 22283 [2022-04-27 15:14:50,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:14:50,090 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:14:50,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 139 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:14:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2022-04-27 15:14:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22281. [2022-04-27 15:14:50,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:14:50,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 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-27 15:14:50,410 INFO L74 IsIncluded]: Start isIncluded. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 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-27 15:14:50,431 INFO L87 Difference]: Start difference. First operand 22283 states. Second operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 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-27 15:15:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:15:03,169 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-27 15:15:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-27 15:15:03,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:15:03,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:15:03,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 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 22283 states. [2022-04-27 15:15:03,242 INFO L87 Difference]: Start difference. First operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 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 22283 states. [2022-04-27 15:15:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:15:16,156 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2022-04-27 15:15:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 22283 states and 32520 transitions. [2022-04-27 15:15:16,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:15:16,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:15:16,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:15:16,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:15:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 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-27 15:15:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22281 states to 22281 states and 32519 transitions. [2022-04-27 15:15:29,157 INFO L78 Accepts]: Start accepts. Automaton has 22281 states and 32519 transitions. Word has length 35 [2022-04-27 15:15:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:15:29,158 INFO L495 AbstractCegarLoop]: Abstraction has 22281 states and 32519 transitions. [2022-04-27 15:15:29,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:15:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 22281 states and 32519 transitions. [2022-04-27 15:15:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 15:15:29,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:15:29,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:15:29,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:15:29,168 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:15:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:15:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -224944604, now seen corresponding path program 1 times [2022-04-27 15:15:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:15:29,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544336192] [2022-04-27 15:15:29,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:15:29,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:15:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:15:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:15:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:15:29,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {574686#(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(18, 2);call #Ultimate.allocInit(12, 3); {574680#true} is VALID [2022-04-27 15:15:29,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {574680#true} assume true; {574680#true} is VALID [2022-04-27 15:15:29,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {574680#true} {574680#true} #285#return; {574680#true} is VALID [2022-04-27 15:15:29,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {574680#true} call ULTIMATE.init(); {574686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:15:29,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {574686#(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(18, 2);call #Ultimate.allocInit(12, 3); {574680#true} is VALID [2022-04-27 15:15:29,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {574680#true} assume true; {574680#true} is VALID [2022-04-27 15:15:29,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574680#true} {574680#true} #285#return; {574680#true} is VALID [2022-04-27 15:15:29,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {574680#true} call #t~ret20 := main(); {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {574680#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {574680#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {574680#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {574680#true} assume !(0 != ~p1~0); {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {574680#true} assume !(0 != ~p2~0); {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {574680#true} assume !(0 != ~p3~0); {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {574680#true} assume !(0 != ~p4~0); {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {574680#true} assume !(0 != ~p5~0); {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {574680#true} assume !(0 != ~p6~0); {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {574680#true} assume !(0 != ~p7~0); {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {574680#true} assume !(0 != ~p8~0); {574680#true} is VALID [2022-04-27 15:15:29,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {574680#true} assume !(0 != ~p9~0); {574680#true} is VALID [2022-04-27 15:15:29,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {574680#true} assume !(0 != ~p10~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {574685#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {574685#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {574685#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {574685#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {574685#(= main_~p10~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {574685#(= main_~p10~0 0)} assume !(0 != ~p1~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {574685#(= main_~p10~0 0)} assume !(0 != ~p2~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {574685#(= main_~p10~0 0)} assume !(0 != ~p3~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {574685#(= main_~p10~0 0)} assume !(0 != ~p4~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {574685#(= main_~p10~0 0)} assume !(0 != ~p5~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {574685#(= main_~p10~0 0)} assume !(0 != ~p6~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {574685#(= main_~p10~0 0)} assume !(0 != ~p7~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {574685#(= main_~p10~0 0)} assume !(0 != ~p8~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {574685#(= main_~p10~0 0)} assume !(0 != ~p9~0); {574685#(= main_~p10~0 0)} is VALID [2022-04-27 15:15:29,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {574685#(= main_~p10~0 0)} assume 0 != ~p10~0; {574681#false} is VALID [2022-04-27 15:15:29,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {574681#false} assume 1 != ~lk10~0; {574681#false} is VALID [2022-04-27 15:15:29,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {574681#false} assume !false; {574681#false} is VALID [2022-04-27 15:15:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:15:29,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:15:29,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544336192] [2022-04-27 15:15:29,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544336192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:15:29,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:15:29,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:15:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996601159] [2022-04-27 15:15:29,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:15:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 35 [2022-04-27 15:15:29,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:15:29,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:15:29,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:15:29,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:15:29,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:15:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:15:29,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:15:29,244 INFO L87 Difference]: Start difference. First operand 22281 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:19:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:19:25,434 INFO L93 Difference]: Finished difference Result 65293 states and 94473 transitions. [2022-04-27 15:19:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:19:25,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 35 [2022-04-27 15:19:25,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:19:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:19:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-27 15:19:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:19:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2022-04-27 15:19:25,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 256 transitions. [2022-04-27 15:19:25,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:20:21,024 INFO L225 Difference]: With dead ends: 65293 [2022-04-27 15:20:21,025 INFO L226 Difference]: Without dead ends: 43531 [2022-04-27 15:20:21,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:20:21,037 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:20:21,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 117 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:20:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43531 states. [2022-04-27 15:20:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43531 to 43529. [2022-04-27 15:20:21,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:20:21,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43531 states. Second operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 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-27 15:20:21,616 INFO L74 IsIncluded]: Start isIncluded. First operand 43531 states. Second operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 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-27 15:20:21,664 INFO L87 Difference]: Start difference. First operand 43531 states. Second operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 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-27 15:21:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:21:16,940 INFO L93 Difference]: Finished difference Result 43531 states and 61960 transitions. [2022-04-27 15:21:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 43531 states and 61960 transitions. [2022-04-27 15:21:16,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:21:16,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:21:17,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 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 43531 states. [2022-04-27 15:21:17,042 INFO L87 Difference]: Start difference. First operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 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 43531 states. [2022-04-27 15:22:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:22:08,586 INFO L93 Difference]: Finished difference Result 43531 states and 61960 transitions. [2022-04-27 15:22:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 43531 states and 61960 transitions. [2022-04-27 15:22:08,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:22:08,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:22:08,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:22:08,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:22:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 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-27 15:23:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43529 states to 43529 states and 61959 transitions. [2022-04-27 15:23:20,877 INFO L78 Accepts]: Start accepts. Automaton has 43529 states and 61959 transitions. Word has length 35 [2022-04-27 15:23:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:23:20,877 INFO L495 AbstractCegarLoop]: Abstraction has 43529 states and 61959 transitions. [2022-04-27 15:23:20,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:23:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 43529 states and 61959 transitions. [2022-04-27 15:23:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 15:23:20,892 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:23:20,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:23:20,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:23:20,893 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:23:20,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:23:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1769200102, now seen corresponding path program 1 times [2022-04-27 15:23:20,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:23:20,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696822869] [2022-04-27 15:23:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:23:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:23:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:23:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:23:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:23:20,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {773156#(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(18, 2);call #Ultimate.allocInit(12, 3); {773150#true} is VALID [2022-04-27 15:23:20,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {773150#true} assume true; {773150#true} is VALID [2022-04-27 15:23:20,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {773150#true} {773150#true} #285#return; {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {773150#true} call ULTIMATE.init(); {773156#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {773156#(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(18, 2);call #Ultimate.allocInit(12, 3); {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {773150#true} assume true; {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {773150#true} {773150#true} #285#return; {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {773150#true} call #t~ret20 := main(); {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {773150#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;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {773150#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {773150#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;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {773150#true} assume !(0 != ~p1~0); {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {773150#true} assume !(0 != ~p2~0); {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {773150#true} assume !(0 != ~p3~0); {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {773150#true} assume !(0 != ~p4~0); {773150#true} is VALID [2022-04-27 15:23:20,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {773150#true} assume !(0 != ~p5~0); {773150#true} is VALID [2022-04-27 15:23:20,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {773150#true} assume !(0 != ~p6~0); {773150#true} is VALID [2022-04-27 15:23:20,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {773150#true} assume !(0 != ~p7~0); {773150#true} is VALID [2022-04-27 15:23:20,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {773150#true} assume !(0 != ~p8~0); {773150#true} is VALID [2022-04-27 15:23:20,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {773150#true} assume !(0 != ~p9~0); {773150#true} is VALID [2022-04-27 15:23:20,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {773150#true} assume 0 != ~p10~0;~lk10~0 := 1; {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {773155#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {773155#(= main_~lk10~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {773155#(= main_~lk10~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {773155#(= main_~lk10~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {773155#(= main_~lk10~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {773155#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {773155#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {773155#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {773155#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {773155#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {773155#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {773155#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {773155#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {773155#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {773155#(= main_~lk10~0 1)} assume 0 != ~p10~0; {773155#(= main_~lk10~0 1)} is VALID [2022-04-27 15:23:20,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {773155#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {773151#false} is VALID [2022-04-27 15:23:20,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {773151#false} assume !false; {773151#false} is VALID [2022-04-27 15:23:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:23:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:23:20,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696822869] [2022-04-27 15:23:20,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696822869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:23:20,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:23:20,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:23:20,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895907368] [2022-04-27 15:23:20,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:23:20,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 35 [2022-04-27 15:23:20,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:23:20,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-27 15:23:20,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:23:20,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:23:20,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:23:20,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:23:20,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:23:20,959 INFO L87 Difference]: Start difference. First operand 43529 states and 61959 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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)