/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/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:07:55,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:07:55,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:07:55,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:07:55,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:07:55,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:07:55,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:07:55,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:07:55,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:07:55,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:07:55,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:07:55,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:07:55,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:07:55,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:07:55,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:07:55,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:07:55,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:07:55,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:07:55,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:07:55,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:07:55,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:07:55,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:07:55,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:07:55,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:07:55,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:07:55,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:07:55,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:07:55,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:07:55,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:07:55,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:07:55,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:07:55,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:07:55,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:07:55,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:07:55,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:07:55,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:07:55,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:07:55,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:07:55,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:07:55,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:07:55,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:07:55,263 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 01:07:55,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:07:55,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:07:55,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:07:55,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:07:55,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:07:55,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:07:55,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:07:55,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:07:55,300 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:07:55,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:07:55,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:07:55,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:07:55,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:07:55,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:07:55,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:07:55,302 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:07:55,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:07:55,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:07:55,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:07:55,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:07:55,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:07:55,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:07:55,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:07:55,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:07:55,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:07:55,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:07:55,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:07:55,304 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:07:55,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:07:55,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:07:55,304 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 01:07:55,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:07:55,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:07:55,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:07:55,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:07:55,574 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:07:55,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2022-01-10 01:07:55,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea28625a0/9cfcdff046464966963bd0f5e55fb89b/FLAGdc47990b1 [2022-01-10 01:07:56,111 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:07:56,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2022-01-10 01:07:56,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea28625a0/9cfcdff046464966963bd0f5e55fb89b/FLAGdc47990b1 [2022-01-10 01:07:56,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea28625a0/9cfcdff046464966963bd0f5e55fb89b [2022-01-10 01:07:56,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:07:56,609 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:07:56,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:07:56,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:07:56,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:07:56,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e7f3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56, skipping insertion in model container [2022-01-10 01:07:56,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:07:56,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:07:56,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c[706,719] [2022-01-10 01:07:56,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:07:56,832 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:07:56,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c[706,719] [2022-01-10 01:07:56,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:07:56,875 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:07:56,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56 WrapperNode [2022-01-10 01:07:56,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:07:56,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:07:56,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:07:56,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:07:56,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,913 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2022-01-10 01:07:56,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:07:56,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:07:56,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:07:56,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:07:56,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:07:56,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:07:56,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:07:56,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:07:56,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (1/1) ... [2022-01-10 01:07:56,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:07:56,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:07:56,974 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 01:07:56,976 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 01:07:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:07:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-01-10 01:07:57,004 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-01-10 01:07:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-01-10 01:07:57,004 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-01-10 01:07:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 01:07:57,004 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 01:07:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-01-10 01:07:57,004 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-01-10 01:07:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-01-10 01:07:57,004 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-01-10 01:07:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:07:57,005 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-01-10 01:07:57,005 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-01-10 01:07:57,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:07:57,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:07:57,085 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:07:57,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:07:57,349 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:07:57,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:07:57,356 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 01:07:57,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:57 BoogieIcfgContainer [2022-01-10 01:07:57,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:07:57,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:07:57,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:07:57,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:07:57,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:07:56" (1/3) ... [2022-01-10 01:07:57,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e513cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:57, skipping insertion in model container [2022-01-10 01:07:57,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:56" (2/3) ... [2022-01-10 01:07:57,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e513cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:57, skipping insertion in model container [2022-01-10 01:07:57,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:57" (3/3) ... [2022-01-10 01:07:57,365 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2022-01-10 01:07:57,369 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:07:57,369 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:07:57,403 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:07:57,409 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 01:07:57,409 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:07:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 01:07:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 01:07:57,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:07:57,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:07:57,434 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:07:57,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:07:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2055872345, now seen corresponding path program 1 times [2022-01-10 01:07:57,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:07:57,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614071109] [2022-01-10 01:07:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:07:57,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:07:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:57,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:07:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:57,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:07:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:07:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:57,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:07:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:07:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:57,803 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 01:07:57,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:07:57,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614071109] [2022-01-10 01:07:57,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614071109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:07:57,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:07:57,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:07:57,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296887923] [2022-01-10 01:07:57,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:07:57,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:07:57,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:07:57,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:07:57,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:07:57,849 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:07:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:07:58,240 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2022-01-10 01:07:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:07:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 01:07:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:07:58,251 INFO L225 Difference]: With dead ends: 277 [2022-01-10 01:07:58,251 INFO L226 Difference]: Without dead ends: 153 [2022-01-10 01:07:58,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:07:58,258 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 268 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:07:58,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 325 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:07:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-01-10 01:07:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2022-01-10 01:07:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 01:07:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2022-01-10 01:07:58,306 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 67 [2022-01-10 01:07:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:07:58,306 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2022-01-10 01:07:58,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:07:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2022-01-10 01:07:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 01:07:58,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:07:58,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:07:58,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:07:58,310 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:07:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:07:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1622143259, now seen corresponding path program 1 times [2022-01-10 01:07:58,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:07:58,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934983209] [2022-01-10 01:07:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:07:58,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:07:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:58,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:07:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:07:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:58,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:07:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:58,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:07:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:58,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:07:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:58,416 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 01:07:58,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:07:58,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934983209] [2022-01-10 01:07:58,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934983209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:07:58,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:07:58,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 01:07:58,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210389332] [2022-01-10 01:07:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:07:58,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:07:58,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:07:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:07:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:07:58,419 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:07:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:07:59,076 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2022-01-10 01:07:59,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:07:59,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 01:07:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:07:59,086 INFO L225 Difference]: With dead ends: 406 [2022-01-10 01:07:59,086 INFO L226 Difference]: Without dead ends: 293 [2022-01-10 01:07:59,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:07:59,088 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 377 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:07:59,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 501 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 01:07:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-01-10 01:07:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-01-10 01:07:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-01-10 01:07:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2022-01-10 01:07:59,120 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 67 [2022-01-10 01:07:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:07:59,120 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2022-01-10 01:07:59,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:07:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2022-01-10 01:07:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 01:07:59,122 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:07:59,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:07:59,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:07:59,123 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:07:59,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:07:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1762963514, now seen corresponding path program 1 times [2022-01-10 01:07:59,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:07:59,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905737094] [2022-01-10 01:07:59,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:07:59,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:07:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:07:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:07:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:07:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:07:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:07:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,249 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 01:07:59,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:07:59,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905737094] [2022-01-10 01:07:59,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905737094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:07:59,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:07:59,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:07:59,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547022980] [2022-01-10 01:07:59,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:07:59,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:07:59,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:07:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:07:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:07:59,252 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:07:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:07:59,635 INFO L93 Difference]: Finished difference Result 516 states and 750 transitions. [2022-01-10 01:07:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 01:07:59,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 01:07:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:07:59,643 INFO L225 Difference]: With dead ends: 516 [2022-01-10 01:07:59,643 INFO L226 Difference]: Without dead ends: 293 [2022-01-10 01:07:59,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 01:07:59,653 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 279 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:07:59,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 446 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:07:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-01-10 01:07:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-01-10 01:07:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-01-10 01:07:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2022-01-10 01:07:59,705 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 67 [2022-01-10 01:07:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:07:59,705 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2022-01-10 01:07:59,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:07:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-01-10 01:07:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 01:07:59,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:07:59,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:07:59,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 01:07:59,715 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:07:59,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:07:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1655984776, now seen corresponding path program 1 times [2022-01-10 01:07:59,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:07:59,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231674580] [2022-01-10 01:07:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:07:59,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:07:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:07:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:07:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:07:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:07:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:07:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:07:59,811 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 01:07:59,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:07:59,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231674580] [2022-01-10 01:07:59,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231674580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:07:59,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:07:59,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:07:59,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205481425] [2022-01-10 01:07:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:07:59,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:07:59,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:07:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:07:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:07:59,813 INFO L87 Difference]: Start difference. First operand 233 states and 331 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:00,671 INFO L93 Difference]: Finished difference Result 689 states and 986 transitions. [2022-01-10 01:08:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 01:08:00,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 01:08:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:00,675 INFO L225 Difference]: With dead ends: 689 [2022-01-10 01:08:00,675 INFO L226 Difference]: Without dead ends: 466 [2022-01-10 01:08:00,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 01:08:00,676 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 384 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:00,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 887 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 01:08:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-01-10 01:08:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 337. [2022-01-10 01:08:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-01-10 01:08:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 475 transitions. [2022-01-10 01:08:00,704 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 475 transitions. Word has length 67 [2022-01-10 01:08:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:00,706 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 475 transitions. [2022-01-10 01:08:00,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 475 transitions. [2022-01-10 01:08:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 01:08:00,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:00,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:00,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 01:08:00,715 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1212084102, now seen corresponding path program 1 times [2022-01-10 01:08:00,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:00,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140963272] [2022-01-10 01:08:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:00,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:00,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:00,787 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 01:08:00,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:00,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140963272] [2022-01-10 01:08:00,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140963272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:00,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:00,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:08:00,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264340844] [2022-01-10 01:08:00,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:00,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:08:00,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:00,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:08:00,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:00,789 INFO L87 Difference]: Start difference. First operand 337 states and 475 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:01,608 INFO L93 Difference]: Finished difference Result 1074 states and 1524 transitions. [2022-01-10 01:08:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 01:08:01,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 01:08:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:01,613 INFO L225 Difference]: With dead ends: 1074 [2022-01-10 01:08:01,613 INFO L226 Difference]: Without dead ends: 747 [2022-01-10 01:08:01,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-01-10 01:08:01,615 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 396 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:01,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 854 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 01:08:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-01-10 01:08:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 544. [2022-01-10 01:08:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-01-10 01:08:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 768 transitions. [2022-01-10 01:08:01,675 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 768 transitions. Word has length 67 [2022-01-10 01:08:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:01,675 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 768 transitions. [2022-01-10 01:08:01,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 768 transitions. [2022-01-10 01:08:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 01:08:01,677 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:01,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:01,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 01:08:01,677 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1054297084, now seen corresponding path program 1 times [2022-01-10 01:08:01,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:01,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301553286] [2022-01-10 01:08:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:01,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:01,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:01,761 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 01:08:01,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:01,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301553286] [2022-01-10 01:08:01,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301553286] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:01,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:01,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:08:01,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799288627] [2022-01-10 01:08:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:01,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:08:01,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:01,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:08:01,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:01,763 INFO L87 Difference]: Start difference. First operand 544 states and 768 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:02,275 INFO L93 Difference]: Finished difference Result 1203 states and 1727 transitions. [2022-01-10 01:08:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 01:08:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 01:08:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:02,280 INFO L225 Difference]: With dead ends: 1203 [2022-01-10 01:08:02,280 INFO L226 Difference]: Without dead ends: 670 [2022-01-10 01:08:02,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-01-10 01:08:02,282 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 254 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:02,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 580 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:08:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-01-10 01:08:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 547. [2022-01-10 01:08:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-01-10 01:08:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 767 transitions. [2022-01-10 01:08:02,318 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 767 transitions. Word has length 67 [2022-01-10 01:08:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:02,318 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 767 transitions. [2022-01-10 01:08:02,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 767 transitions. [2022-01-10 01:08:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 01:08:02,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:02,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:02,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 01:08:02,320 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:02,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1302443578, now seen corresponding path program 1 times [2022-01-10 01:08:02,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:02,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082933447] [2022-01-10 01:08:02,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:02,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:02,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:02,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:02,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:02,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:02,394 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 01:08:02,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:02,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082933447] [2022-01-10 01:08:02,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082933447] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:02,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:02,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:08:02,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453850367] [2022-01-10 01:08:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:02,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:08:02,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:08:02,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:02,395 INFO L87 Difference]: Start difference. First operand 547 states and 767 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:02,904 INFO L93 Difference]: Finished difference Result 1269 states and 1814 transitions. [2022-01-10 01:08:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 01:08:02,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 01:08:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:02,908 INFO L225 Difference]: With dead ends: 1269 [2022-01-10 01:08:02,908 INFO L226 Difference]: Without dead ends: 733 [2022-01-10 01:08:02,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-01-10 01:08:02,910 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 254 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:02,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 569 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:08:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-01-10 01:08:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 562. [2022-01-10 01:08:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-01-10 01:08:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2022-01-10 01:08:02,945 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 67 [2022-01-10 01:08:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:02,945 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2022-01-10 01:08:02,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2022-01-10 01:08:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 01:08:02,946 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:02,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:02,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 01:08:02,947 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash 908076792, now seen corresponding path program 1 times [2022-01-10 01:08:02,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:02,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939207462] [2022-01-10 01:08:02,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:02,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:03,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:03,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:03,056 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 01:08:03,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:03,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939207462] [2022-01-10 01:08:03,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939207462] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:03,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:03,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:08:03,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408304552] [2022-01-10 01:08:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:03,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:08:03,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:08:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:03,058 INFO L87 Difference]: Start difference. First operand 562 states and 782 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:04,224 INFO L93 Difference]: Finished difference Result 2996 states and 4324 transitions. [2022-01-10 01:08:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 01:08:04,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-01-10 01:08:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:04,237 INFO L225 Difference]: With dead ends: 2996 [2022-01-10 01:08:04,238 INFO L226 Difference]: Without dead ends: 2445 [2022-01-10 01:08:04,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-01-10 01:08:04,241 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1008 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:04,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1031 Valid, 848 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 01:08:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2022-01-10 01:08:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1559. [2022-01-10 01:08:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-01-10 01:08:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2171 transitions. [2022-01-10 01:08:04,360 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2171 transitions. Word has length 67 [2022-01-10 01:08:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:04,360 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 2171 transitions. [2022-01-10 01:08:04,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:04,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2171 transitions. [2022-01-10 01:08:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 01:08:04,362 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:04,363 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:04,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 01:08:04,363 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 918077039, now seen corresponding path program 1 times [2022-01-10 01:08:04,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:04,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012719177] [2022-01-10 01:08:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:04,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:04,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:04,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:04,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:08:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 01:08:04,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:04,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012719177] [2022-01-10 01:08:04,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012719177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:04,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:04,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:08:04,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571256938] [2022-01-10 01:08:04,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:04,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:08:04,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:08:04,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:04,470 INFO L87 Difference]: Start difference. First operand 1559 states and 2171 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:05,038 INFO L93 Difference]: Finished difference Result 3474 states and 4944 transitions. [2022-01-10 01:08:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 01:08:05,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-01-10 01:08:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:05,049 INFO L225 Difference]: With dead ends: 3474 [2022-01-10 01:08:05,050 INFO L226 Difference]: Without dead ends: 1926 [2022-01-10 01:08:05,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-01-10 01:08:05,056 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 171 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:05,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 569 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:08:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-01-10 01:08:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1589. [2022-01-10 01:08:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-01-10 01:08:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2196 transitions. [2022-01-10 01:08:05,201 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2196 transitions. Word has length 84 [2022-01-10 01:08:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:05,201 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 2196 transitions. [2022-01-10 01:08:05,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2196 transitions. [2022-01-10 01:08:05,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 01:08:05,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:05,203 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:05,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 01:08:05,204 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:05,204 INFO L85 PathProgramCache]: Analyzing trace with hash 564988657, now seen corresponding path program 1 times [2022-01-10 01:08:05,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:05,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152968669] [2022-01-10 01:08:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:05,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:08:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 01:08:05,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:05,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152968669] [2022-01-10 01:08:05,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152968669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:05,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:05,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:08:05,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857747590] [2022-01-10 01:08:05,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:05,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:08:05,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:05,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:08:05,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:05,286 INFO L87 Difference]: Start difference. First operand 1589 states and 2196 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:05,725 INFO L93 Difference]: Finished difference Result 3422 states and 4752 transitions. [2022-01-10 01:08:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:08:05,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-01-10 01:08:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:05,734 INFO L225 Difference]: With dead ends: 3422 [2022-01-10 01:08:05,734 INFO L226 Difference]: Without dead ends: 1845 [2022-01-10 01:08:05,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-10 01:08:05,738 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 326 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:05,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 415 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 01:08:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2022-01-10 01:08:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1577. [2022-01-10 01:08:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-01-10 01:08:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2148 transitions. [2022-01-10 01:08:05,855 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2148 transitions. Word has length 84 [2022-01-10 01:08:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:05,855 INFO L470 AbstractCegarLoop]: Abstraction has 1577 states and 2148 transitions. [2022-01-10 01:08:05,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2148 transitions. [2022-01-10 01:08:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 01:08:05,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:05,858 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:05,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 01:08:05,858 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:05,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash 813135151, now seen corresponding path program 1 times [2022-01-10 01:08:05,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:05,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193320018] [2022-01-10 01:08:05,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:05,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:08:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 01:08:05,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:05,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193320018] [2022-01-10 01:08:05,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193320018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:05,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:05,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:08:05,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023832957] [2022-01-10 01:08:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:05,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 01:08:05,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:05,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 01:08:05,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:08:05,952 INFO L87 Difference]: Start difference. First operand 1577 states and 2148 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:06,780 INFO L93 Difference]: Finished difference Result 2572 states and 3512 transitions. [2022-01-10 01:08:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 01:08:06,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-01-10 01:08:06,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:06,797 INFO L225 Difference]: With dead ends: 2572 [2022-01-10 01:08:06,797 INFO L226 Difference]: Without dead ends: 1597 [2022-01-10 01:08:06,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-01-10 01:08:06,801 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 485 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:06,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 656 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 01:08:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2022-01-10 01:08:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1258. [2022-01-10 01:08:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2022-01-10 01:08:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1691 transitions. [2022-01-10 01:08:06,894 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1691 transitions. Word has length 84 [2022-01-10 01:08:06,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:06,894 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1691 transitions. [2022-01-10 01:08:06,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1691 transitions. [2022-01-10 01:08:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 01:08:06,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:06,896 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:06,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 01:08:06,896 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:06,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:06,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1236781873, now seen corresponding path program 1 times [2022-01-10 01:08:06,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:06,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83702455] [2022-01-10 01:08:06,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:06,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:06,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:06,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:08:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 01:08:06,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:06,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83702455] [2022-01-10 01:08:06,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83702455] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:06,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:06,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:08:06,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381079080] [2022-01-10 01:08:06,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:06,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 01:08:06,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:06,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 01:08:06,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:08:06,998 INFO L87 Difference]: Start difference. First operand 1258 states and 1691 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:07,781 INFO L93 Difference]: Finished difference Result 2777 states and 3732 transitions. [2022-01-10 01:08:07,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 01:08:07,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-01-10 01:08:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:07,790 INFO L225 Difference]: With dead ends: 2777 [2022-01-10 01:08:07,790 INFO L226 Difference]: Without dead ends: 1622 [2022-01-10 01:08:07,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-01-10 01:08:07,795 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 610 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:07,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [618 Valid, 593 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 01:08:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-01-10 01:08:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1246. [2022-01-10 01:08:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2022-01-10 01:08:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1667 transitions. [2022-01-10 01:08:07,891 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1667 transitions. Word has length 84 [2022-01-10 01:08:07,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:07,892 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 1667 transitions. [2022-01-10 01:08:07,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 01:08:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1667 transitions. [2022-01-10 01:08:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 01:08:07,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:07,894 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:07,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 01:08:07,894 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:07,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash -608585293, now seen corresponding path program 1 times [2022-01-10 01:08:07,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:07,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764931066] [2022-01-10 01:08:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:07,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:07,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:08:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 01:08:07,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:07,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764931066] [2022-01-10 01:08:07,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764931066] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:08:07,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224422329] [2022-01-10 01:08:07,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:07,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:07,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:08:07,971 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 01:08:08,003 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 01:08:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:08,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:08:08,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:08:08,240 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:08:08,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:08:08,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224422329] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:08,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:08:08,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-01-10 01:08:08,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308910210] [2022-01-10 01:08:08,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:08,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:08:08,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:08,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:08:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:08,241 INFO L87 Difference]: Start difference. First operand 1246 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 01:08:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:08,406 INFO L93 Difference]: Finished difference Result 2883 states and 3926 transitions. [2022-01-10 01:08:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:08:08,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2022-01-10 01:08:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:08,416 INFO L225 Difference]: With dead ends: 2883 [2022-01-10 01:08:08,417 INFO L226 Difference]: Without dead ends: 2039 [2022-01-10 01:08:08,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:08,421 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 129 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:08,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 474 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:08:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2022-01-10 01:08:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2022-01-10 01:08:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2022-01-10 01:08:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2750 transitions. [2022-01-10 01:08:08,585 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2750 transitions. Word has length 84 [2022-01-10 01:08:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:08,585 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 2750 transitions. [2022-01-10 01:08:08,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 01:08:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2750 transitions. [2022-01-10 01:08:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 01:08:08,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:08,587 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:08,616 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 01:08:08,803 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,SelfDestructingSolverStorable12 [2022-01-10 01:08:08,804 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash -55730782, now seen corresponding path program 1 times [2022-01-10 01:08:08,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:08,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241321033] [2022-01-10 01:08:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:08,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:08,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:08,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:08,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:08,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:08:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:08,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 01:08:08,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:08,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241321033] [2022-01-10 01:08:08,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241321033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:08,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:08,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 01:08:08,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135005431] [2022-01-10 01:08:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:08,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:08:08,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:08:08,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:08,921 INFO L87 Difference]: Start difference. First operand 2039 states and 2750 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 01:08:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:09,625 INFO L93 Difference]: Finished difference Result 6620 states and 9061 transitions. [2022-01-10 01:08:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:08:09,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-01-10 01:08:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:09,647 INFO L225 Difference]: With dead ends: 6620 [2022-01-10 01:08:09,647 INFO L226 Difference]: Without dead ends: 4593 [2022-01-10 01:08:09,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:08:09,655 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 611 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:09,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 501 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:08:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-01-10 01:08:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4197. [2022-01-10 01:08:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2022-01-10 01:08:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 5702 transitions. [2022-01-10 01:08:10,048 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 5702 transitions. Word has length 99 [2022-01-10 01:08:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:10,048 INFO L470 AbstractCegarLoop]: Abstraction has 4197 states and 5702 transitions. [2022-01-10 01:08:10,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 01:08:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 5702 transitions. [2022-01-10 01:08:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 01:08:10,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:10,050 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:10,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 01:08:10,051 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1996312796, now seen corresponding path program 1 times [2022-01-10 01:08:10,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:10,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367634000] [2022-01-10 01:08:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:10,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:10,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:10,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:10,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:10,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:10,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:08:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 01:08:10,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:10,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367634000] [2022-01-10 01:08:10,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367634000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:10,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:10,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:08:10,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103870282] [2022-01-10 01:08:10,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:10,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:08:10,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:10,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:08:10,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:08:10,115 INFO L87 Difference]: Start difference. First operand 4197 states and 5702 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 01:08:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:10,636 INFO L93 Difference]: Finished difference Result 8948 states and 12144 transitions. [2022-01-10 01:08:10,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 01:08:10,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-01-10 01:08:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:10,661 INFO L225 Difference]: With dead ends: 8948 [2022-01-10 01:08:10,661 INFO L226 Difference]: Without dead ends: 4762 [2022-01-10 01:08:10,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:08:10,674 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 323 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:10,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 266 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:08:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4762 states. [2022-01-10 01:08:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4762 to 4192. [2022-01-10 01:08:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4192 states, 3531 states have (on average 1.3101104502973662) internal successors, (4626), 3584 states have internal predecessors, (4626), 363 states have call successors, (363), 230 states have call predecessors, (363), 297 states have return successors, (703), 378 states have call predecessors, (703), 363 states have call successors, (703) [2022-01-10 01:08:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 5692 transitions. [2022-01-10 01:08:11,059 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 5692 transitions. Word has length 99 [2022-01-10 01:08:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:11,059 INFO L470 AbstractCegarLoop]: Abstraction has 4192 states and 5692 transitions. [2022-01-10 01:08:11,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 01:08:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 5692 transitions. [2022-01-10 01:08:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-10 01:08:11,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:11,061 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:11,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 01:08:11,061 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:11,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:11,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1243137275, now seen corresponding path program 1 times [2022-01-10 01:08:11,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:11,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416203528] [2022-01-10 01:08:11,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:11,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:11,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:11,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:11,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:11,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:08:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:11,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 01:08:11,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:11,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416203528] [2022-01-10 01:08:11,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416203528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:11,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:11,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 01:08:11,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114295957] [2022-01-10 01:08:11,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:11,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 01:08:11,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:11,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 01:08:11,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 01:08:11,137 INFO L87 Difference]: Start difference. First operand 4192 states and 5692 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:08:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:11,979 INFO L93 Difference]: Finished difference Result 9970 states and 13687 transitions. [2022-01-10 01:08:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 01:08:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2022-01-10 01:08:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:12,028 INFO L225 Difference]: With dead ends: 9970 [2022-01-10 01:08:12,029 INFO L226 Difference]: Without dead ends: 6565 [2022-01-10 01:08:12,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:08:12,044 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 417 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:12,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 352 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 01:08:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2022-01-10 01:08:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 5725. [2022-01-10 01:08:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5725 states, 4816 states have (on average 1.3054401993355482) internal successors, (6287), 4881 states have internal predecessors, (6287), 504 states have call successors, (504), 321 states have call predecessors, (504), 404 states have return successors, (923), 523 states have call predecessors, (923), 504 states have call successors, (923) [2022-01-10 01:08:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 7714 transitions. [2022-01-10 01:08:12,577 INFO L78 Accepts]: Start accepts. Automaton has 5725 states and 7714 transitions. Word has length 100 [2022-01-10 01:08:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:12,578 INFO L470 AbstractCegarLoop]: Abstraction has 5725 states and 7714 transitions. [2022-01-10 01:08:12,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:08:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5725 states and 7714 transitions. [2022-01-10 01:08:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 01:08:12,583 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:12,583 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:12,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 01:08:12,584 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1869458483, now seen corresponding path program 1 times [2022-01-10 01:08:12,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:12,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530393987] [2022-01-10 01:08:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:12,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 01:08:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 01:08:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 01:08:12,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:12,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530393987] [2022-01-10 01:08:12,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530393987] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:08:12,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277660614] [2022-01-10 01:08:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:12,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:08:12,659 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 01:08:12,672 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 01:08:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:12,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:08:12,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:08:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:08:12,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:08:12,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277660614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:12,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:08:12,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-01-10 01:08:12,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880959756] [2022-01-10 01:08:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:12,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:08:12,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:08:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:12,990 INFO L87 Difference]: Start difference. First operand 5725 states and 7714 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:08:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:13,492 INFO L93 Difference]: Finished difference Result 13443 states and 18129 transitions. [2022-01-10 01:08:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:08:13,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2022-01-10 01:08:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:13,523 INFO L225 Difference]: With dead ends: 13443 [2022-01-10 01:08:13,523 INFO L226 Difference]: Without dead ends: 7715 [2022-01-10 01:08:13,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:13,544 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 86 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:13,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 368 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:08:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2022-01-10 01:08:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7649. [2022-01-10 01:08:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7649 states, 6430 states have (on average 1.3021772939346812) internal successors, (8373), 6510 states have internal predecessors, (8373), 682 states have call successors, (682), 438 states have call predecessors, (682), 536 states have return successors, (1154), 701 states have call predecessors, (1154), 682 states have call successors, (1154) [2022-01-10 01:08:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7649 states to 7649 states and 10209 transitions. [2022-01-10 01:08:14,186 INFO L78 Accepts]: Start accepts. Automaton has 7649 states and 10209 transitions. Word has length 117 [2022-01-10 01:08:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:14,186 INFO L470 AbstractCegarLoop]: Abstraction has 7649 states and 10209 transitions. [2022-01-10 01:08:14,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:08:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 7649 states and 10209 transitions. [2022-01-10 01:08:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-01-10 01:08:14,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:14,191 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:14,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 01:08:14,407 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,SelfDestructingSolverStorable16 [2022-01-10 01:08:14,408 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 964798723, now seen corresponding path program 1 times [2022-01-10 01:08:14,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:14,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193686704] [2022-01-10 01:08:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:14,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 01:08:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-01-10 01:08:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 01:08:14,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:14,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193686704] [2022-01-10 01:08:14,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193686704] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:08:14,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744260236] [2022-01-10 01:08:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:14,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:08:14,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:08:14,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 01:08:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:14,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:08:14,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:08:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 01:08:14,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:08:14,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744260236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:14,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:08:14,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-01-10 01:08:14,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256653233] [2022-01-10 01:08:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:14,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:08:14,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:08:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:14,829 INFO L87 Difference]: Start difference. First operand 7649 states and 10209 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:08:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:15,531 INFO L93 Difference]: Finished difference Result 16201 states and 22003 transitions. [2022-01-10 01:08:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:08:15,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2022-01-10 01:08:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:15,567 INFO L225 Difference]: With dead ends: 16201 [2022-01-10 01:08:15,567 INFO L226 Difference]: Without dead ends: 9348 [2022-01-10 01:08:15,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:15,589 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 121 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:15,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 221 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:08:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9348 states. [2022-01-10 01:08:16,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9348 to 9241. [2022-01-10 01:08:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9241 states, 7848 states have (on average 1.2719164118246686) internal successors, (9982), 7944 states have internal predecessors, (9982), 758 states have call successors, (758), 529 states have call predecessors, (758), 634 states have return successors, (1380), 768 states have call predecessors, (1380), 758 states have call successors, (1380) [2022-01-10 01:08:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 12120 transitions. [2022-01-10 01:08:16,271 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 12120 transitions. Word has length 118 [2022-01-10 01:08:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:16,271 INFO L470 AbstractCegarLoop]: Abstraction has 9241 states and 12120 transitions. [2022-01-10 01:08:16,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 01:08:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 12120 transitions. [2022-01-10 01:08:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 01:08:16,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:16,275 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 01:08:16,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 01:08:16,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-10 01:08:16,492 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash -36607372, now seen corresponding path program 1 times [2022-01-10 01:08:16,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:16,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117179752] [2022-01-10 01:08:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:16,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 01:08:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:08:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 01:08:16,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:16,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117179752] [2022-01-10 01:08:16,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117179752] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:08:16,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610132004] [2022-01-10 01:08:16,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:16,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:16,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:08:16,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:08:16,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 01:08:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:16,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 01:08:16,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:08:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 01:08:16,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:08:16,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610132004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:16,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:08:16,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-01-10 01:08:16,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123272743] [2022-01-10 01:08:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:16,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:08:16,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:08:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:16,858 INFO L87 Difference]: Start difference. First operand 9241 states and 12120 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:08:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:17,548 INFO L93 Difference]: Finished difference Result 16957 states and 22181 transitions. [2022-01-10 01:08:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:08:17,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2022-01-10 01:08:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:17,591 INFO L225 Difference]: With dead ends: 16957 [2022-01-10 01:08:17,591 INFO L226 Difference]: Without dead ends: 9930 [2022-01-10 01:08:17,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:08:17,609 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:17,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:08:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2022-01-10 01:08:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 9843. [2022-01-10 01:08:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 8423 states have (on average 1.2614270449958447) internal successors, (10625), 8525 states have internal predecessors, (10625), 758 states have call successors, (758), 550 states have call predecessors, (758), 661 states have return successors, (1272), 768 states have call predecessors, (1272), 758 states have call successors, (1272) [2022-01-10 01:08:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12655 transitions. [2022-01-10 01:08:18,465 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12655 transitions. Word has length 121 [2022-01-10 01:08:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:18,466 INFO L470 AbstractCegarLoop]: Abstraction has 9843 states and 12655 transitions. [2022-01-10 01:08:18,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 01:08:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12655 transitions. [2022-01-10 01:08:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-10 01:08:18,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:18,472 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:18,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 01:08:18,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:18,687 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:18,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:18,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1792814822, now seen corresponding path program 1 times [2022-01-10 01:08:18,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:18,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476437059] [2022-01-10 01:08:18,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:18,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 01:08:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-10 01:08:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-10 01:08:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-01-10 01:08:18,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:18,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476437059] [2022-01-10 01:08:18,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476437059] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:08:18,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477357351] [2022-01-10 01:08:18,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:18,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:18,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:08:18,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:08:18,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 01:08:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:18,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:08:18,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:08:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 01:08:19,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:08:19,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477357351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:19,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:08:19,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-01-10 01:08:19,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061649496] [2022-01-10 01:08:19,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:19,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:08:19,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:19,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:08:19,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:08:19,124 INFO L87 Difference]: Start difference. First operand 9843 states and 12655 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 01:08:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:20,434 INFO L93 Difference]: Finished difference Result 28741 states and 37387 transitions. [2022-01-10 01:08:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:08:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 153 [2022-01-10 01:08:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:20,495 INFO L225 Difference]: With dead ends: 28741 [2022-01-10 01:08:20,495 INFO L226 Difference]: Without dead ends: 18910 [2022-01-10 01:08:20,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:08:20,513 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 147 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:20,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 364 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:08:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18910 states. [2022-01-10 01:08:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18895. [2022-01-10 01:08:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18895 states, 16195 states have (on average 1.250077184316147) internal successors, (20245), 16388 states have internal predecessors, (20245), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-01-10 01:08:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18895 states to 18895 states and 24374 transitions. [2022-01-10 01:08:21,790 INFO L78 Accepts]: Start accepts. Automaton has 18895 states and 24374 transitions. Word has length 153 [2022-01-10 01:08:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:21,791 INFO L470 AbstractCegarLoop]: Abstraction has 18895 states and 24374 transitions. [2022-01-10 01:08:21,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 01:08:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 18895 states and 24374 transitions. [2022-01-10 01:08:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 01:08:21,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:21,800 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:21,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 01:08:22,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:22,026 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash -970215938, now seen corresponding path program 1 times [2022-01-10 01:08:22,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:22,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585593882] [2022-01-10 01:08:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:22,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-10 01:08:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:08:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 01:08:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-10 01:08:22,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585593882] [2022-01-10 01:08:22,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585593882] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:08:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259965521] [2022-01-10 01:08:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:22,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:22,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:08:22,114 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:08:22,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 01:08:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:22,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:08:22,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:08:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 01:08:22,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:08:22,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259965521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:22,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:08:22,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-01-10 01:08:22,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073820629] [2022-01-10 01:08:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:22,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:08:22,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:22,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:08:22,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:08:22,463 INFO L87 Difference]: Start difference. First operand 18895 states and 24374 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:08:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:23,717 INFO L93 Difference]: Finished difference Result 29234 states and 38669 transitions. [2022-01-10 01:08:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:08:23,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 154 [2022-01-10 01:08:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:23,787 INFO L225 Difference]: With dead ends: 29234 [2022-01-10 01:08:23,787 INFO L226 Difference]: Without dead ends: 18527 [2022-01-10 01:08:23,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:08:23,821 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 118 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:23,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 461 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:08:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18527 states. [2022-01-10 01:08:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18527 to 18465. [2022-01-10 01:08:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18465 states, 15765 states have (on average 1.238883602917856) internal successors, (19531), 15958 states have internal predecessors, (19531), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-01-10 01:08:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18465 states to 18465 states and 23660 transitions. [2022-01-10 01:08:25,214 INFO L78 Accepts]: Start accepts. Automaton has 18465 states and 23660 transitions. Word has length 154 [2022-01-10 01:08:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:25,214 INFO L470 AbstractCegarLoop]: Abstraction has 18465 states and 23660 transitions. [2022-01-10 01:08:25,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 01:08:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 18465 states and 23660 transitions. [2022-01-10 01:08:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-10 01:08:25,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:25,223 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:25,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 01:08:25,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:25,447 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:25,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:25,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1358937995, now seen corresponding path program 1 times [2022-01-10 01:08:25,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:25,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516701539] [2022-01-10 01:08:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:25,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-10 01:08:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:08:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 01:08:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-10 01:08:25,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:25,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516701539] [2022-01-10 01:08:25,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516701539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:25,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:25,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 01:08:25,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305048804] [2022-01-10 01:08:25,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:25,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:08:25,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:25,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:08:25,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:08:25,533 INFO L87 Difference]: Start difference. First operand 18465 states and 23660 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 01:08:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:27,066 INFO L93 Difference]: Finished difference Result 33725 states and 43529 transitions. [2022-01-10 01:08:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 01:08:27,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 155 [2022-01-10 01:08:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:27,124 INFO L225 Difference]: With dead ends: 33725 [2022-01-10 01:08:27,124 INFO L226 Difference]: Without dead ends: 17956 [2022-01-10 01:08:27,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-10 01:08:27,159 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 561 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:27,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 586 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 01:08:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17956 states. [2022-01-10 01:08:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17956 to 16098. [2022-01-10 01:08:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16098 states, 13792 states have (on average 1.2261455916473318) internal successors, (16911), 13972 states have internal predecessors, (16911), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-01-10 01:08:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16098 states to 16098 states and 20177 transitions. [2022-01-10 01:08:28,310 INFO L78 Accepts]: Start accepts. Automaton has 16098 states and 20177 transitions. Word has length 155 [2022-01-10 01:08:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:28,311 INFO L470 AbstractCegarLoop]: Abstraction has 16098 states and 20177 transitions. [2022-01-10 01:08:28,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 01:08:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 16098 states and 20177 transitions. [2022-01-10 01:08:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-10 01:08:28,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:28,318 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:28,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 01:08:28,319 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash 217702764, now seen corresponding path program 1 times [2022-01-10 01:08:28,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:28,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458108304] [2022-01-10 01:08:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:28,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-10 01:08:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:08:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 01:08:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 01:08:28,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:28,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458108304] [2022-01-10 01:08:28,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458108304] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:08:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803827312] [2022-01-10 01:08:28,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:28,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:28,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:08:28,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:08:28,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 01:08:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:28,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:08:28,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:08:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 01:08:28,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:08:28,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803827312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:28,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:08:28,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-01-10 01:08:28,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546867820] [2022-01-10 01:08:28,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:28,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:08:28,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:28,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:08:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:08:28,736 INFO L87 Difference]: Start difference. First operand 16098 states and 20177 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 01:08:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:29,600 INFO L93 Difference]: Finished difference Result 28643 states and 36407 transitions. [2022-01-10 01:08:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:08:29,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 156 [2022-01-10 01:08:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:29,653 INFO L225 Difference]: With dead ends: 28643 [2022-01-10 01:08:29,654 INFO L226 Difference]: Without dead ends: 16151 [2022-01-10 01:08:29,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:08:29,694 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:29,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:08:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16151 states. [2022-01-10 01:08:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16151 to 16082. [2022-01-10 01:08:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16082 states, 13776 states have (on average 1.2047038327526132) internal successors, (16596), 13956 states have internal predecessors, (16596), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-01-10 01:08:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16082 states to 16082 states and 19862 transitions. [2022-01-10 01:08:30,962 INFO L78 Accepts]: Start accepts. Automaton has 16082 states and 19862 transitions. Word has length 156 [2022-01-10 01:08:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:30,962 INFO L470 AbstractCegarLoop]: Abstraction has 16082 states and 19862 transitions. [2022-01-10 01:08:30,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 01:08:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 16082 states and 19862 transitions. [2022-01-10 01:08:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-10 01:08:30,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:30,968 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:30,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 01:08:31,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:08:31,191 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1852604969, now seen corresponding path program 2 times [2022-01-10 01:08:31,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:31,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359010499] [2022-01-10 01:08:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:31,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:08:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 01:08:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:08:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:08:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:08:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-10 01:08:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-10 01:08:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 01:08:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 01:08:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:08:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-10 01:08:31,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:08:31,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359010499] [2022-01-10 01:08:31,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359010499] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:08:31,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:08:31,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 01:08:31,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93656302] [2022-01-10 01:08:31,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:08:31,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 01:08:31,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:08:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 01:08:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 01:08:31,289 INFO L87 Difference]: Start difference. First operand 16082 states and 19862 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 01:08:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:08:33,478 INFO L93 Difference]: Finished difference Result 40643 states and 51929 transitions. [2022-01-10 01:08:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 01:08:33,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 156 [2022-01-10 01:08:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:08:33,535 INFO L225 Difference]: With dead ends: 40643 [2022-01-10 01:08:33,535 INFO L226 Difference]: Without dead ends: 24579 [2022-01-10 01:08:33,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-01-10 01:08:33,576 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 912 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 01:08:33,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [924 Valid, 504 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 01:08:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24579 states. [2022-01-10 01:08:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24579 to 23029. [2022-01-10 01:08:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23029 states, 19688 states have (on average 1.1473994311255586) internal successors, (22590), 20035 states have internal predecessors, (22590), 1643 states have call successors, (1643), 1326 states have call predecessors, (1643), 1697 states have return successors, (3030), 1669 states have call predecessors, (3030), 1643 states have call successors, (3030) [2022-01-10 01:08:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 27263 transitions. [2022-01-10 01:08:35,117 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 27263 transitions. Word has length 156 [2022-01-10 01:08:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:08:35,118 INFO L470 AbstractCegarLoop]: Abstraction has 23029 states and 27263 transitions. [2022-01-10 01:08:35,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 01:08:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 27263 transitions. [2022-01-10 01:08:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-10 01:08:35,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:08:35,123 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:08:35,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 01:08:35,123 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:08:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:08:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash -217774742, now seen corresponding path program 1 times [2022-01-10 01:08:35,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:08:35,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65695125] [2022-01-10 01:08:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:08:35,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:08:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:08:35,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 01:08:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:08:35,181 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 01:08:35,181 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 01:08:35,182 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:08:35,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 01:08:35,186 INFO L732 BasicCegarLoop]: Path program histogram: [2, 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 01:08:35,189 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:08:35,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:08:35 BoogieIcfgContainer [2022-01-10 01:08:35,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:08:35,281 INFO L158 Benchmark]: Toolchain (without parser) took 38672.06ms. Allocated memory was 182.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 131.9MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 450.6MB. Max. memory is 8.0GB. [2022-01-10 01:08:35,281 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 148.5MB in the beginning and 148.4MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:08:35,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.69ms. Allocated memory is still 182.5MB. Free memory was 131.7MB in the beginning and 156.1MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 01:08:35,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.22ms. Allocated memory is still 182.5MB. Free memory was 156.1MB in the beginning and 154.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 01:08:35,282 INFO L158 Benchmark]: Boogie Preprocessor took 23.08ms. Allocated memory is still 182.5MB. Free memory was 154.0MB in the beginning and 152.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 01:08:35,282 INFO L158 Benchmark]: RCFGBuilder took 420.08ms. Allocated memory is still 182.5MB. Free memory was 152.4MB in the beginning and 135.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-10 01:08:35,282 INFO L158 Benchmark]: TraceAbstraction took 37920.14ms. Allocated memory was 182.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 134.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 455.6MB. Max. memory is 8.0GB. [2022-01-10 01:08:35,283 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.12ms. Allocated memory is still 182.5MB. Free memory was 148.5MB in the beginning and 148.4MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.69ms. Allocated memory is still 182.5MB. Free memory was 131.7MB in the beginning and 156.1MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.22ms. Allocated memory is still 182.5MB. Free memory was 156.1MB in the beginning and 154.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.08ms. Allocated memory is still 182.5MB. Free memory was 154.0MB in the beginning and 152.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 420.08ms. Allocated memory is still 182.5MB. Free memory was 152.4MB in the beginning and 135.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 37920.14ms. Allocated memory was 182.5MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 134.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 455.6MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.8s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8635 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8448 mSDsluCounter, 12182 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7022 mSDsCounter, 1514 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8818 IncrementalHoareTripleChecker+Invalid, 10332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1514 mSolverCounterUnsat, 5160 mSDtfsCounter, 8818 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1550 GetRequests, 1299 SyntacticMatches, 2 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23029occurred in iteration=24, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 8602 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3444 NumberOfCodeBlocks, 3444 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 6782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2763 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 865/990 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 RESULT: Ultimate proved your program to be incorrect! [2022-01-10 01:08:35,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...