/usr/bin/java -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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:36:58,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:36:58,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:36:58,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:36:58,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:36:58,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:36:58,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:36:58,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:36:58,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:36:58,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:36:58,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:36:58,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:36:58,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:36:58,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:36:58,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:36:58,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:36:58,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:36:58,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:36:58,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:36:58,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:36:58,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:36:58,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:36:58,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:36:58,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:36:58,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:36:58,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:36:58,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:36:58,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:36:58,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:36:58,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:36:58,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:36:58,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:36:58,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:36:59,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:36:59,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:36:59,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:36:59,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:36:59,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:36:59,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:36:59,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:36:59,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:36:59,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:36:59,024 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:36:59,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:36:59,025 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:36:59,025 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:36:59,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:36:59,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:36:59,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:36:59,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:36:59,026 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:36:59,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:36:59,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:36:59,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:36:59,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:36:59,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:36:59,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:36:59,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:36:59,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:36:59,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:36:59,028 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:36:59,028 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:36:59,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:36:59,028 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-01-10 00:36:59,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:36:59,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:36:59,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:36:59,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:36:59,220 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:36:59,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2022-01-10 00:36:59,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90b22572/6798f86d885842c6a0626b2138a2a7d2/FLAGc42d90081 [2022-01-10 00:36:59,589 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:36:59,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2022-01-10 00:36:59,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90b22572/6798f86d885842c6a0626b2138a2a7d2/FLAGc42d90081 [2022-01-10 00:36:59,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90b22572/6798f86d885842c6a0626b2138a2a7d2 [2022-01-10 00:36:59,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:37:00,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:37:00,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:37:00,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:37:00,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:37:00,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:59" (1/1) ... [2022-01-10 00:37:00,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e8ae49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00, skipping insertion in model container [2022-01-10 00:37:00,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:36:59" (1/1) ... [2022-01-10 00:37:00,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:37:00,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:37:00,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c[24720,24733] [2022-01-10 00:37:00,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:37:00,287 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:37:00,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c[24720,24733] [2022-01-10 00:37:00,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:37:00,353 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:37:00,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00 WrapperNode [2022-01-10 00:37:00,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:37:00,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:37:00,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:37:00,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:37:00,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,421 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 415 [2022-01-10 00:37:00,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:37:00,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:37:00,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:37:00,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:37:00,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:37:00,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:37:00,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:37:00,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:37:00,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (1/1) ... [2022-01-10 00:37:00,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:37:00,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:37:00,516 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-01-10 00:37:00,535 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-01-10 00:37:00,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:37:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:37:00,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:37:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:37:00,635 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:37:00,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:37:01,076 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:37:01,081 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:37:01,082 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 00:37:01,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:01 BoogieIcfgContainer [2022-01-10 00:37:01,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:37:01,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:37:01,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:37:01,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:37:01,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:36:59" (1/3) ... [2022-01-10 00:37:01,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33ead9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:01, skipping insertion in model container [2022-01-10 00:37:01,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:00" (2/3) ... [2022-01-10 00:37:01,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33ead9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:01, skipping insertion in model container [2022-01-10 00:37:01,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:01" (3/3) ... [2022-01-10 00:37:01,089 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2022-01-10 00:37:01,093 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:37:01,093 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:37:01,129 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:37:01,133 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:37:01,133 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:37:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 107 states have (on average 1.9532710280373833) internal successors, (209), 108 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 00:37:01,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:01,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:37:01,168 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:01,173 INFO L85 PathProgramCache]: Analyzing trace with hash 352571511, now seen corresponding path program 1 times [2022-01-10 00:37:01,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:01,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688792813] [2022-01-10 00:37:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:01,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:37:01,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:01,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688792813] [2022-01-10 00:37:01,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688792813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:37:01,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:37:01,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:37:01,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523211892] [2022-01-10 00:37:01,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:37:01,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:37:01,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:01,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:37:01,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:37:01,352 INFO L87 Difference]: Start difference. First operand has 109 states, 107 states have (on average 1.9532710280373833) internal successors, (209), 108 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:01,383 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2022-01-10 00:37:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:37:01,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-10 00:37:01,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:01,392 INFO L225 Difference]: With dead ends: 216 [2022-01-10 00:37:01,392 INFO L226 Difference]: Without dead ends: 100 [2022-01-10 00:37:01,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:37:01,398 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:01,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:37:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-01-10 00:37:01,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-01-10 00:37:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 99 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2022-01-10 00:37:01,438 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2022-01-10 00:37:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:01,438 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2022-01-10 00:37:01,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2022-01-10 00:37:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 00:37:01,440 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:01,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:37:01,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:37:01,441 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:01,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1422697561, now seen corresponding path program 1 times [2022-01-10 00:37:01,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:01,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874943877] [2022-01-10 00:37:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:01,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:37:01,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:01,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874943877] [2022-01-10 00:37:01,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874943877] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:37:01,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:37:01,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:37:01,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69039320] [2022-01-10 00:37:01,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:37:01,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:37:01,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:01,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:37:01,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:01,497 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:01,550 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2022-01-10 00:37:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:37:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-01-10 00:37:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:01,553 INFO L225 Difference]: With dead ends: 201 [2022-01-10 00:37:01,553 INFO L226 Difference]: Without dead ends: 103 [2022-01-10 00:37:01,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:01,554 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:01,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 308 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:37:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-10 00:37:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-01-10 00:37:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 102 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2022-01-10 00:37:01,559 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2022-01-10 00:37:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:01,559 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2022-01-10 00:37:01,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2022-01-10 00:37:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 00:37:01,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:01,560 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:37:01,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:37:01,561 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:01,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:01,561 INFO L85 PathProgramCache]: Analyzing trace with hash 658032730, now seen corresponding path program 1 times [2022-01-10 00:37:01,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:01,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275487228] [2022-01-10 00:37:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:01,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:37:01,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:01,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275487228] [2022-01-10 00:37:01,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275487228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:37:01,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:37:01,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:37:01,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687303036] [2022-01-10 00:37:01,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:37:01,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:37:01,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:01,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:37:01,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:37:01,758 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:01,977 INFO L93 Difference]: Finished difference Result 207 states and 335 transitions. [2022-01-10 00:37:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:37:01,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 00:37:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:01,979 INFO L225 Difference]: With dead ends: 207 [2022-01-10 00:37:01,979 INFO L226 Difference]: Without dead ends: 188 [2022-01-10 00:37:01,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:37:01,980 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 269 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:01,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 316 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 00:37:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-01-10 00:37:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2022-01-10 00:37:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.6432748538011697) internal successors, (281), 171 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2022-01-10 00:37:01,991 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2022-01-10 00:37:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:01,992 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2022-01-10 00:37:01,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2022-01-10 00:37:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 00:37:01,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:01,993 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:37:01,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:37:01,993 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:01,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:01,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1675425412, now seen corresponding path program 1 times [2022-01-10 00:37:01,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:01,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935479392] [2022-01-10 00:37:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:01,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:37:02,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:02,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935479392] [2022-01-10 00:37:02,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935479392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:37:02,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:37:02,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:37:02,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410154904] [2022-01-10 00:37:02,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:37:02,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:37:02,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:02,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:37:02,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:02,020 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:02,041 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2022-01-10 00:37:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:37:02,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 00:37:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:02,042 INFO L225 Difference]: With dead ends: 293 [2022-01-10 00:37:02,042 INFO L226 Difference]: Without dead ends: 124 [2022-01-10 00:37:02,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:02,044 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 30 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:02,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 283 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:37:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-10 00:37:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2022-01-10 00:37:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2022-01-10 00:37:02,049 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2022-01-10 00:37:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:02,049 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2022-01-10 00:37:02,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2022-01-10 00:37:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 00:37:02,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:02,050 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:37:02,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:37:02,050 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:02,050 INFO L85 PathProgramCache]: Analyzing trace with hash -843118083, now seen corresponding path program 1 times [2022-01-10 00:37:02,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:02,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612523278] [2022-01-10 00:37:02,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:02,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 00:37:02,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:02,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612523278] [2022-01-10 00:37:02,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612523278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:37:02,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:37:02,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:37:02,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236944014] [2022-01-10 00:37:02,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:37:02,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:37:02,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:02,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:37:02,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:02,086 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:02,106 INFO L93 Difference]: Finished difference Result 248 states and 395 transitions. [2022-01-10 00:37:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:37:02,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 00:37:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:02,107 INFO L225 Difference]: With dead ends: 248 [2022-01-10 00:37:02,108 INFO L226 Difference]: Without dead ends: 129 [2022-01-10 00:37:02,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:02,109 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 32 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:02,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 282 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:37:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-01-10 00:37:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-01-10 00:37:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 199 transitions. [2022-01-10 00:37:02,113 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 199 transitions. Word has length 21 [2022-01-10 00:37:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:02,113 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 199 transitions. [2022-01-10 00:37:02,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 199 transitions. [2022-01-10 00:37:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 00:37:02,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:02,114 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:37:02,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:37:02,114 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:02,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash -671640130, now seen corresponding path program 1 times [2022-01-10 00:37:02,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:02,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237850969] [2022-01-10 00:37:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:02,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:37:02,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:02,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237850969] [2022-01-10 00:37:02,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237850969] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:37:02,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844057612] [2022-01-10 00:37:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:02,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:37:02,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:37:02,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:37:02,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 00:37:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:02,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 00:37:02,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:37:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:37:02,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:37:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:37:02,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844057612] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:37:02,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:37:02,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-01-10 00:37:02,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386422224] [2022-01-10 00:37:02,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:37:02,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 00:37:02,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 00:37:02,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:37:02,467 INFO L87 Difference]: Start difference. First operand 127 states and 199 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:02,875 INFO L93 Difference]: Finished difference Result 469 states and 734 transitions. [2022-01-10 00:37:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:37:02,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 00:37:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:02,877 INFO L225 Difference]: With dead ends: 469 [2022-01-10 00:37:02,877 INFO L226 Difference]: Without dead ends: 417 [2022-01-10 00:37:02,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-01-10 00:37:02,878 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 1462 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:02,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1462 Valid, 1208 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:37:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-01-10 00:37:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 348. [2022-01-10 00:37:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 347 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 551 transitions. [2022-01-10 00:37:02,893 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 551 transitions. Word has length 23 [2022-01-10 00:37:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:02,893 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 551 transitions. [2022-01-10 00:37:02,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 551 transitions. [2022-01-10 00:37:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 00:37:02,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:02,894 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:37:02,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 00:37:03,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 00:37:03,095 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2124865792, now seen corresponding path program 1 times [2022-01-10 00:37:03,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:03,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525801034] [2022-01-10 00:37:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:03,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:37:03,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:03,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525801034] [2022-01-10 00:37:03,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525801034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:37:03,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:37:03,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:37:03,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658829311] [2022-01-10 00:37:03,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:37:03,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:37:03,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:03,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:37:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:03,166 INFO L87 Difference]: Start difference. First operand 348 states and 551 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:03,178 INFO L93 Difference]: Finished difference Result 351 states and 553 transitions. [2022-01-10 00:37:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:37:03,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 00:37:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:03,180 INFO L225 Difference]: With dead ends: 351 [2022-01-10 00:37:03,180 INFO L226 Difference]: Without dead ends: 344 [2022-01-10 00:37:03,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:03,182 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 147 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:03,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 164 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:37:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-01-10 00:37:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2022-01-10 00:37:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.567251461988304) internal successors, (536), 342 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 536 transitions. [2022-01-10 00:37:03,199 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 536 transitions. Word has length 27 [2022-01-10 00:37:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:03,199 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 536 transitions. [2022-01-10 00:37:03,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 536 transitions. [2022-01-10 00:37:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 00:37:03,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:03,200 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:37:03,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:37:03,200 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:03,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:03,200 INFO L85 PathProgramCache]: Analyzing trace with hash 338445793, now seen corresponding path program 1 times [2022-01-10 00:37:03,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:03,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479122731] [2022-01-10 00:37:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:03,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:37:03,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:03,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479122731] [2022-01-10 00:37:03,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479122731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:37:03,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:37:03,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:37:03,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635203574] [2022-01-10 00:37:03,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:37:03,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:37:03,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:03,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:37:03,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:03,225 INFO L87 Difference]: Start difference. First operand 343 states and 536 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:03,245 INFO L93 Difference]: Finished difference Result 583 states and 907 transitions. [2022-01-10 00:37:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:37:03,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 00:37:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:03,247 INFO L225 Difference]: With dead ends: 583 [2022-01-10 00:37:03,247 INFO L226 Difference]: Without dead ends: 243 [2022-01-10 00:37:03,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:03,248 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 61 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:03,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 184 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:37:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-01-10 00:37:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2022-01-10 00:37:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2022-01-10 00:37:03,254 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 30 [2022-01-10 00:37:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:03,255 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2022-01-10 00:37:03,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2022-01-10 00:37:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 00:37:03,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:03,256 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 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-01-10 00:37:03,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:37:03,256 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash 272165387, now seen corresponding path program 1 times [2022-01-10 00:37:03,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:03,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912730486] [2022-01-10 00:37:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:03,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:37:03,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:03,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912730486] [2022-01-10 00:37:03,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912730486] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:37:03,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:37:03,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:37:03,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511242612] [2022-01-10 00:37:03,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:37:03,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:37:03,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:03,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:37:03,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:03,305 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:03,325 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2022-01-10 00:37:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:37:03,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-10 00:37:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:03,326 INFO L225 Difference]: With dead ends: 424 [2022-01-10 00:37:03,326 INFO L226 Difference]: Without dead ends: 225 [2022-01-10 00:37:03,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:03,328 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 28 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:03,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 212 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:37:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-01-10 00:37:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2022-01-10 00:37:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.4594594594594594) internal successors, (324), 222 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2022-01-10 00:37:03,338 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2022-01-10 00:37:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:03,339 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2022-01-10 00:37:03,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2022-01-10 00:37:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 00:37:03,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:03,343 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 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-01-10 00:37:03,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:37:03,344 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -140510671, now seen corresponding path program 1 times [2022-01-10 00:37:03,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:03,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339223845] [2022-01-10 00:37:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:03,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 00:37:03,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:03,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339223845] [2022-01-10 00:37:03,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339223845] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:37:03,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:37:03,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:37:03,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232907823] [2022-01-10 00:37:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:37:03,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:37:03,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:37:03,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:03,370 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:03,391 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2022-01-10 00:37:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:37:03,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-01-10 00:37:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:03,393 INFO L225 Difference]: With dead ends: 305 [2022-01-10 00:37:03,393 INFO L226 Difference]: Without dead ends: 143 [2022-01-10 00:37:03,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:37:03,394 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 27 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:03,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 184 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:37:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-01-10 00:37:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-01-10 00:37:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4214285714285715) internal successors, (199), 140 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2022-01-10 00:37:03,399 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2022-01-10 00:37:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:03,399 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2022-01-10 00:37:03,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2022-01-10 00:37:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 00:37:03,400 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:37:03,401 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 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-01-10 00:37:03,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:37:03,401 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:37:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:37:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1014660280, now seen corresponding path program 1 times [2022-01-10 00:37:03,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:37:03,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054796227] [2022-01-10 00:37:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:03,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:37:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:37:03,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:37:03,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054796227] [2022-01-10 00:37:03,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054796227] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:37:03,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604372286] [2022-01-10 00:37:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:37:03,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:37:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:37:03,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:37:03,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 00:37:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:37:03,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 00:37:03,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:37:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:37:03,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:37:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:37:03,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604372286] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:37:03,978 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:37:03,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-01-10 00:37:03,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842375436] [2022-01-10 00:37:03,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:37:03,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 00:37:03,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:37:03,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 00:37:03,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-01-10 00:37:03,982 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:37:04,099 INFO L93 Difference]: Finished difference Result 163 states and 231 transitions. [2022-01-10 00:37:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:37:04,100 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-01-10 00:37:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:37:04,100 INFO L225 Difference]: With dead ends: 163 [2022-01-10 00:37:04,100 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 00:37:04,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-10 00:37:04,101 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 511 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:37:04,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 554 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:37:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 00:37:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 00:37:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 00:37:04,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-01-10 00:37:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:37:04,102 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 00:37:04,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:37:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 00:37:04,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 00:37:04,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:37:04,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 00:37:04,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 00:37:04,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 434) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L300(lines 300 302) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 170) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L532(lines 532 534) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 402) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 270) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L500(lines 500 502) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 370) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 60) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 57) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 157) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 257) no Hoare annotation was computed. [2022-01-10 00:37:04,547 INFO L858 garLoopResultBuilder]: For program point L110(lines 110 125) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 55) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L342(lines 342 357) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 225) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 155) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 93) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L442(lines 442 457) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 325) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L244(lines 244 255) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 193) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 123) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L542(lines 542 557) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L410(lines 410 425) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 355) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 293) no Hoare annotation was computed. [2022-01-10 00:37:04,548 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 223) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 91) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 525) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L444(lines 444 455) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 393) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L312(lines 312 323) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L180(lines 180 191) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 50) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L544(lines 544 555) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L478(lines 478 493) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L412(lines 412 423) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L280(lines 280 291) no Hoare annotation was computed. [2022-01-10 00:37:04,549 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 150) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L861 garLoopResultBuilder]: At program point L16(lines 16 568) the Hoare annotation is: true [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L512(lines 512 523) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L380(lines 380 391) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 250) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 118) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L480(lines 480 491) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L348(lines 348 350) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 218) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 86) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L448(lines 448 450) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 318) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 186) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L548(lines 548 550) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-01-10 00:37:04,550 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 286) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L854 garLoopResultBuilder]: At program point L549(lines 16 568) the Hoare annotation is: false [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 518) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L384(lines 384 386) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L484(lines 484 486) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 563) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0))) (or (and .cse0 (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0) (<= 5 |ULTIMATE.start_main_~q~0#1|) (<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 2) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 2)) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648))) (and (= |ULTIMATE.start_main_~this_expect~0#1| 0) .cse0 (= |ULTIMATE.start_main_~q~0#1| 0)))) [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L26-3(lines 26 563) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 141) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L226(lines 226 241) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 109) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 160) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 341) no Hoare annotation was computed. [2022-01-10 00:37:04,551 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 209) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 260) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 139) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 77) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L426(lines 426 441) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 309) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L261(lines 261 360) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 239) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 177) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 107) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L854 garLoopResultBuilder]: At program point L559(lines 26 563) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 1) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 1))) (.cse0 (<= (div |ULTIMATE.start_main_~P8~0#1| 4294967296) 0)) (.cse4 (<= |ULTIMATE.start_main_~this_expect~0#1| (+ (* 2 (div (+ (- 2) |ULTIMATE.start_main_~this_expect~0#1|) 2)) 2))) (.cse2 (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648))) (.cse5 (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~q~0#1| 4) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_main_~q~0#1| 1) .cse4 .cse2 .cse3) (and .cse5 .cse0 (= 3 |ULTIMATE.start_main_~q~0#1|) .cse1 .cse2) (and .cse5 .cse0 (<= 5 |ULTIMATE.start_main_~q~0#1|) .cse4 .cse2) (and (= |ULTIMATE.start_main_~this_expect~0#1| 0) .cse5 (= |ULTIMATE.start_main_~q~0#1| 0)))) [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L526(lines 526 541) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 409) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 460) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 339) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 277) no Hoare annotation was computed. [2022-01-10 00:37:04,552 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 207) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 75) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 509) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 560) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L428(lines 428 439) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 377) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 307) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 175) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 567) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 539) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L462(lines 462 477) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L396(lines 396 407) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L264(lines 264 275) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 134) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L496(lines 496 507) no Hoare annotation was computed. [2022-01-10 00:37:04,553 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 375) no Hoare annotation was computed. [2022-01-10 00:37:04,554 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-10 00:37:04,554 INFO L858 garLoopResultBuilder]: For program point L100(lines 100 102) no Hoare annotation was computed. [2022-01-10 00:37:04,554 INFO L858 garLoopResultBuilder]: For program point L464(lines 464 475) no Hoare annotation was computed. [2022-01-10 00:37:04,554 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 334) no Hoare annotation was computed. [2022-01-10 00:37:04,554 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 202) no Hoare annotation was computed. [2022-01-10 00:37:04,554 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2022-01-10 00:37:04,556 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:37:04,557 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 00:37:04,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:37:04 BoogieIcfgContainer [2022-01-10 00:37:04,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 00:37:04,569 INFO L158 Benchmark]: Toolchain (without parser) took 4561.44ms. Allocated memory was 185.6MB in the beginning and 245.4MB in the end (delta: 59.8MB). Free memory was 131.1MB in the beginning and 100.5MB in the end (delta: 30.6MB). Peak memory consumption was 91.5MB. Max. memory is 8.0GB. [2022-01-10 00:37:04,569 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:37:04,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.25ms. Allocated memory was 185.6MB in the beginning and 245.4MB in the end (delta: 59.8MB). Free memory was 130.9MB in the beginning and 209.1MB in the end (delta: -78.2MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-01-10 00:37:04,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.67ms. Allocated memory is still 245.4MB. Free memory was 209.1MB in the beginning and 204.3MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 00:37:04,570 INFO L158 Benchmark]: Boogie Preprocessor took 49.63ms. Allocated memory is still 245.4MB. Free memory was 204.3MB in the beginning and 201.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 00:37:04,570 INFO L158 Benchmark]: RCFGBuilder took 610.27ms. Allocated memory is still 245.4MB. Free memory was 201.2MB in the beginning and 167.1MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-01-10 00:37:04,570 INFO L158 Benchmark]: TraceAbstraction took 3484.10ms. Allocated memory is still 245.4MB. Free memory was 167.1MB in the beginning and 100.5MB in the end (delta: 66.6MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. [2022-01-10 00:37:04,571 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 342.25ms. Allocated memory was 185.6MB in the beginning and 245.4MB in the end (delta: 59.8MB). Free memory was 130.9MB in the beginning and 209.1MB in the end (delta: -78.2MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.67ms. Allocated memory is still 245.4MB. Free memory was 209.1MB in the beginning and 204.3MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.63ms. Allocated memory is still 245.4MB. Free memory was 204.3MB in the beginning and 201.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 610.27ms. Allocated memory is still 245.4MB. Free memory was 201.2MB in the beginning and 167.1MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3484.10ms. Allocated memory is still 245.4MB. Free memory was 167.1MB in the beginning and 100.5MB in the end (delta: 66.6MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 567]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2571 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2571 mSDsluCounter, 3894 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2106 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 1788 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 96 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 17 NumberOfFragments, 164 HoareAnnotationTreeSize, 4 FomulaSimplifications, 343 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 426 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 2412 SizeOfPredicates, 7 NumberOfNonLiveVariables, 542 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 132/211 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((((P8 / 4294967296 <= 0 && q == 4) && this_expect <= 2 * ((-1 + this_expect) / 2) + 1) && 0 <= P8 + 2147483648) && this_buffer_empty == 1) || ((((P8 / 4294967296 <= 0 && q == 1) && this_expect <= 2 * ((-2 + this_expect) / 2) + 2) && 0 <= P8 + 2147483648) && this_buffer_empty == 1)) || ((((this_buffer_empty == 0 && P8 / 4294967296 <= 0) && 3 == q) && this_expect <= 2 * ((-1 + this_expect) / 2) + 1) && 0 <= P8 + 2147483648)) || ((((this_buffer_empty == 0 && P8 / 4294967296 <= 0) && 5 <= q) && this_expect <= 2 * ((-2 + this_expect) / 2) + 2) && 0 <= P8 + 2147483648)) || ((this_expect == 0 && this_buffer_empty == 0) && q == 0) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((this_buffer_empty == 0 && P8 / 4294967296 <= 0) && 5 <= q) && this_expect <= 2 * ((-2 + this_expect) / 2) + 2) && 0 <= P8 + 2147483648) || ((this_expect == 0 && this_buffer_empty == 0) && q == 0) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-01-10 00:37:04,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...