./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product03.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 859441835e916fdbcdc78c3c849990624cc8f637b8bbdd3bb312aaefa9b36e0f --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 00:40:45,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 00:40:45,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 00:40:46,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 00:40:46,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 00:40:46,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 00:40:46,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 00:40:46,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 00:40:46,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 00:40:46,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 00:40:46,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 00:40:46,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 00:40:46,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 00:40:46,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 00:40:46,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 00:40:46,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 00:40:46,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 00:40:46,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 00:40:46,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 00:40:46,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 00:40:46,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 00:40:46,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 00:40:46,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 00:40:46,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 00:40:46,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 00:40:46,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 00:40:46,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 00:40:46,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 00:40:46,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 00:40:46,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 00:40:46,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 00:40:46,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 00:40:46,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 00:40:46,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 00:40:46,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 00:40:46,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 00:40:46,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 00:40:46,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 00:40:46,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 00:40:46,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 00:40:46,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 00:40:46,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 00:40:46,112 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 00:40:46,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 00:40:46,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 00:40:46,113 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 00:40:46,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 00:40:46,113 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 00:40:46,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 00:40:46,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 00:40:46,114 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 00:40:46,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 00:40:46,115 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 00:40:46,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 00:40:46,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 00:40:46,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 00:40:46,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 00:40:46,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 00:40:46,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 00:40:46,116 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 00:40:46,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 00:40:46,116 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 00:40:46,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 00:40:46,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 00:40:46,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 00:40:46,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 00:40:46,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:40:46,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 00:40:46,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 00:40:46,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 00:40:46,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 00:40:46,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 00:40:46,118 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 00:40:46,119 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 00:40:46,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 00:40:46,119 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 00:40:46,119 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 859441835e916fdbcdc78c3c849990624cc8f637b8bbdd3bb312aaefa9b36e0f [2021-12-16 00:40:46,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 00:40:46,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 00:40:46,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 00:40:46,315 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 00:40:46,315 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 00:40:46,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product03.cil.c [2021-12-16 00:40:46,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54aea7a5/33b1d5270d904ea8a3c8710215e904fc/FLAGaa071ec0e [2021-12-16 00:40:46,830 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 00:40:46,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product03.cil.c [2021-12-16 00:40:46,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54aea7a5/33b1d5270d904ea8a3c8710215e904fc/FLAGaa071ec0e [2021-12-16 00:40:46,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54aea7a5/33b1d5270d904ea8a3c8710215e904fc [2021-12-16 00:40:46,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 00:40:46,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 00:40:46,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 00:40:46,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 00:40:46,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 00:40:46,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:40:46" (1/1) ... [2021-12-16 00:40:46,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606a6dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:46, skipping insertion in model container [2021-12-16 00:40:46,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:40:46" (1/1) ... [2021-12-16 00:40:46,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 00:40:46,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 00:40:47,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product03.cil.c[29828,29841] [2021-12-16 00:40:47,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:40:47,334 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 00:40:47,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product03.cil.c[29828,29841] [2021-12-16 00:40:47,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:40:47,448 INFO L208 MainTranslator]: Completed translation [2021-12-16 00:40:47,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47 WrapperNode [2021-12-16 00:40:47,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 00:40:47,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 00:40:47,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 00:40:47,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 00:40:47,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,515 INFO L137 Inliner]: procedures = 92, calls = 336, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1071 [2021-12-16 00:40:47,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 00:40:47,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 00:40:47,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 00:40:47,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 00:40:47,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 00:40:47,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 00:40:47,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 00:40:47,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 00:40:47,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (1/1) ... [2021-12-16 00:40:47,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:40:47,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:40:47,603 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) [2021-12-16 00:40:47,631 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 [2021-12-16 00:40:47,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 00:40:47,639 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2021-12-16 00:40:47,639 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2021-12-16 00:40:47,639 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2021-12-16 00:40:47,639 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2021-12-16 00:40:47,639 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2021-12-16 00:40:47,639 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2021-12-16 00:40:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2021-12-16 00:40:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2021-12-16 00:40:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2021-12-16 00:40:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2021-12-16 00:40:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2021-12-16 00:40:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2021-12-16 00:40:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2021-12-16 00:40:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2021-12-16 00:40:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2021-12-16 00:40:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2021-12-16 00:40:47,642 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2021-12-16 00:40:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2021-12-16 00:40:47,642 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2021-12-16 00:40:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2021-12-16 00:40:47,642 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2021-12-16 00:40:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2021-12-16 00:40:47,642 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2021-12-16 00:40:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2021-12-16 00:40:47,643 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2021-12-16 00:40:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2021-12-16 00:40:47,643 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2021-12-16 00:40:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2021-12-16 00:40:47,643 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2021-12-16 00:40:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2021-12-16 00:40:47,643 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2021-12-16 00:40:47,644 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2021-12-16 00:40:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2021-12-16 00:40:47,644 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2021-12-16 00:40:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2021-12-16 00:40:47,644 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2021-12-16 00:40:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2021-12-16 00:40:47,644 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2021-12-16 00:40:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 00:40:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2021-12-16 00:40:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2021-12-16 00:40:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2021-12-16 00:40:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2021-12-16 00:40:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2021-12-16 00:40:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2021-12-16 00:40:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 00:40:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 00:40:47,654 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2021-12-16 00:40:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2021-12-16 00:40:47,781 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 00:40:47,796 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 00:40:48,532 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 00:40:48,546 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 00:40:48,547 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 00:40:48,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:40:48 BoogieIcfgContainer [2021-12-16 00:40:48,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 00:40:48,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 00:40:48,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 00:40:48,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 00:40:48,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:40:46" (1/3) ... [2021-12-16 00:40:48,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf4eb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:40:48, skipping insertion in model container [2021-12-16 00:40:48,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:40:47" (2/3) ... [2021-12-16 00:40:48,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf4eb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:40:48, skipping insertion in model container [2021-12-16 00:40:48,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:40:48" (3/3) ... [2021-12-16 00:40:48,557 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product03.cil.c [2021-12-16 00:40:48,560 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 00:40:48,560 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 00:40:48,596 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 00:40:48,601 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 [2021-12-16 00:40:48,602 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 00:40:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 426 states have (on average 1.6948356807511737) internal successors, (722), 447 states have internal predecessors, (722), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2021-12-16 00:40:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-16 00:40:48,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:40:48,655 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:40:48,655 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:40:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:40:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1217975181, now seen corresponding path program 1 times [2021-12-16 00:40:48,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:40:48,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164759748] [2021-12-16 00:40:48,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:40:48,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:40:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:40:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 00:40:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 00:40:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:40:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:40:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:40:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:40:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:40:49,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:40:49,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164759748] [2021-12-16 00:40:49,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164759748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:40:49,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:40:49,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 00:40:49,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888063786] [2021-12-16 00:40:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:40:49,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 00:40:49,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:40:49,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 00:40:49,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 00:40:49,380 INFO L87 Difference]: Start difference. First operand has 545 states, 426 states have (on average 1.6948356807511737) internal successors, (722), 447 states have internal predecessors, (722), 94 states have call successors, (94), 23 states have call predecessors, (94), 23 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:40:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:40:53,264 INFO L93 Difference]: Finished difference Result 1329 states and 2269 transitions. [2021-12-16 00:40:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 00:40:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2021-12-16 00:40:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:40:53,280 INFO L225 Difference]: With dead ends: 1329 [2021-12-16 00:40:53,281 INFO L226 Difference]: Without dead ends: 796 [2021-12-16 00:40:53,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:40:53,290 INFO L933 BasicCegarLoop]: 946 mSDtfsCounter, 1791 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1870 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-12-16 00:40:53,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1870 Valid, 2303 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-12-16 00:40:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-12-16 00:40:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 537. [2021-12-16 00:40:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.6904761904761905) internal successors, (710), 439 states have internal predecessors, (710), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:40:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 893 transitions. [2021-12-16 00:40:53,379 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 893 transitions. Word has length 102 [2021-12-16 00:40:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:40:53,380 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 893 transitions. [2021-12-16 00:40:53,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:40:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 893 transitions. [2021-12-16 00:40:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-16 00:40:53,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:40:53,384 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:40:53,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 00:40:53,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:40:53,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:40:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash -493393200, now seen corresponding path program 1 times [2021-12-16 00:40:53,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:40:53,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12938534] [2021-12-16 00:40:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:40:53,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:40:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:40:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:40:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-16 00:40:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:40:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:40:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:40:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:40:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:40:53,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:40:53,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12938534] [2021-12-16 00:40:53,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12938534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:40:53,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:40:53,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 00:40:53,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806996446] [2021-12-16 00:40:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:40:53,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 00:40:53,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:40:53,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 00:40:53,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 00:40:53,709 INFO L87 Difference]: Start difference. First operand 537 states and 893 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:40:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:40:57,719 INFO L93 Difference]: Finished difference Result 1315 states and 2231 transitions. [2021-12-16 00:40:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 00:40:57,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2021-12-16 00:40:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:40:57,724 INFO L225 Difference]: With dead ends: 1315 [2021-12-16 00:40:57,724 INFO L226 Difference]: Without dead ends: 796 [2021-12-16 00:40:57,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:40:57,727 INFO L933 BasicCegarLoop]: 948 mSDtfsCounter, 933 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-16 00:40:57,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1012 Valid, 2422 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-12-16 00:40:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-12-16 00:40:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 537. [2021-12-16 00:40:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.688095238095238) internal successors, (709), 439 states have internal predecessors, (709), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:40:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 892 transitions. [2021-12-16 00:40:57,796 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 892 transitions. Word has length 105 [2021-12-16 00:40:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:40:57,797 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 892 transitions. [2021-12-16 00:40:57,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:40:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 892 transitions. [2021-12-16 00:40:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-16 00:40:57,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:40:57,802 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:40:57,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 00:40:57,803 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:40:57,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:40:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1657049085, now seen corresponding path program 1 times [2021-12-16 00:40:57,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:40:57,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035246409] [2021-12-16 00:40:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:40:57,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:40:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:57,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:40:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:57,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:57,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-16 00:40:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 00:40:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:40:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:40:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:40:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:40:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:40:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:40:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:40:58,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:40:58,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035246409] [2021-12-16 00:40:58,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035246409] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:40:58,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:40:58,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 00:40:58,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111819051] [2021-12-16 00:40:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:40:58,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 00:40:58,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:40:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 00:40:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 00:40:58,164 INFO L87 Difference]: Start difference. First operand 537 states and 892 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:41:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:01,487 INFO L93 Difference]: Finished difference Result 1315 states and 2230 transitions. [2021-12-16 00:41:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 00:41:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2021-12-16 00:41:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:01,492 INFO L225 Difference]: With dead ends: 1315 [2021-12-16 00:41:01,492 INFO L226 Difference]: Without dead ends: 796 [2021-12-16 00:41:01,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:01,494 INFO L933 BasicCegarLoop]: 944 mSDtfsCounter, 1358 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:01,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 2337 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-16 00:41:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-12-16 00:41:01,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 537. [2021-12-16 00:41:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.6857142857142857) internal successors, (708), 439 states have internal predecessors, (708), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 891 transitions. [2021-12-16 00:41:01,529 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 891 transitions. Word has length 106 [2021-12-16 00:41:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:01,529 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 891 transitions. [2021-12-16 00:41:01,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:41:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 891 transitions. [2021-12-16 00:41:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-16 00:41:01,532 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:01,532 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:01,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 00:41:01,532 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash -455717396, now seen corresponding path program 1 times [2021-12-16 00:41:01,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:01,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400475415] [2021-12-16 00:41:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:01,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 00:41:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 00:41:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:01,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:01,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400475415] [2021-12-16 00:41:01,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400475415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:01,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:01,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 00:41:01,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457361958] [2021-12-16 00:41:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:01,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 00:41:01,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 00:41:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 00:41:01,843 INFO L87 Difference]: Start difference. First operand 537 states and 891 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:41:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:05,028 INFO L93 Difference]: Finished difference Result 1315 states and 2229 transitions. [2021-12-16 00:41:05,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 00:41:05,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2021-12-16 00:41:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:05,031 INFO L225 Difference]: With dead ends: 1315 [2021-12-16 00:41:05,032 INFO L226 Difference]: Without dead ends: 796 [2021-12-16 00:41:05,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:05,041 INFO L933 BasicCegarLoop]: 947 mSDtfsCounter, 1766 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1845 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:05,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1845 Valid, 2293 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 2252 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-16 00:41:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-12-16 00:41:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 537. [2021-12-16 00:41:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.6833333333333333) internal successors, (707), 439 states have internal predecessors, (707), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 890 transitions. [2021-12-16 00:41:05,078 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 890 transitions. Word has length 107 [2021-12-16 00:41:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:05,079 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 890 transitions. [2021-12-16 00:41:05,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:41:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 890 transitions. [2021-12-16 00:41:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-16 00:41:05,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:05,083 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:05,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 00:41:05,083 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1583969447, now seen corresponding path program 1 times [2021-12-16 00:41:05,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:05,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130435809] [2021-12-16 00:41:05,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:05,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 00:41:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-16 00:41:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:05,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:05,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130435809] [2021-12-16 00:41:05,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130435809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:05,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:05,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 00:41:05,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890309257] [2021-12-16 00:41:05,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:05,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 00:41:05,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:05,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 00:41:05,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 00:41:05,362 INFO L87 Difference]: Start difference. First operand 537 states and 890 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:41:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:08,507 INFO L93 Difference]: Finished difference Result 1315 states and 2228 transitions. [2021-12-16 00:41:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 00:41:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2021-12-16 00:41:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:08,511 INFO L225 Difference]: With dead ends: 1315 [2021-12-16 00:41:08,511 INFO L226 Difference]: Without dead ends: 796 [2021-12-16 00:41:08,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:08,513 INFO L933 BasicCegarLoop]: 943 mSDtfsCounter, 1765 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:08,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1844 Valid, 2280 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-16 00:41:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2021-12-16 00:41:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 537. [2021-12-16 00:41:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.680952380952381) internal successors, (706), 439 states have internal predecessors, (706), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 889 transitions. [2021-12-16 00:41:08,555 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 889 transitions. Word has length 108 [2021-12-16 00:41:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:08,555 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 889 transitions. [2021-12-16 00:41:08,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-16 00:41:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 889 transitions. [2021-12-16 00:41:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-16 00:41:08,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:08,557 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:08,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 00:41:08,558 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:08,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2037922056, now seen corresponding path program 1 times [2021-12-16 00:41:08,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:08,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233983442] [2021-12-16 00:41:08,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:08,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 00:41:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 00:41:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:08,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:08,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233983442] [2021-12-16 00:41:08,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233983442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:08,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:08,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 00:41:08,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961461984] [2021-12-16 00:41:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:08,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:41:08,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:08,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:41:08,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:08,873 INFO L87 Difference]: Start difference. First operand 537 states and 889 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:13,578 INFO L93 Difference]: Finished difference Result 1283 states and 2163 transitions. [2021-12-16 00:41:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 00:41:13,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2021-12-16 00:41:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:13,582 INFO L225 Difference]: With dead ends: 1283 [2021-12-16 00:41:13,582 INFO L226 Difference]: Without dead ends: 804 [2021-12-16 00:41:13,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-16 00:41:13,584 INFO L933 BasicCegarLoop]: 901 mSDtfsCounter, 975 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 4823 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 3934 SdHoareTripleChecker+Invalid, 5156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 4823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:13,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 3934 Invalid, 5156 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [333 Valid, 4823 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-12-16 00:41:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-12-16 00:41:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 537. [2021-12-16 00:41:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.6690476190476191) internal successors, (701), 439 states have internal predecessors, (701), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 884 transitions. [2021-12-16 00:41:13,638 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 884 transitions. Word has length 109 [2021-12-16 00:41:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:13,638 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 884 transitions. [2021-12-16 00:41:13,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 884 transitions. [2021-12-16 00:41:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-16 00:41:13,641 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:13,642 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:13,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 00:41:13,642 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:13,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1361119109, now seen corresponding path program 1 times [2021-12-16 00:41:13,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:13,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378206605] [2021-12-16 00:41:13,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:13,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 00:41:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 00:41:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:13,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:13,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378206605] [2021-12-16 00:41:13,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378206605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:13,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:13,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 00:41:13,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708348849] [2021-12-16 00:41:13,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:13,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:41:13,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:13,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:41:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:13,952 INFO L87 Difference]: Start difference. First operand 537 states and 884 transitions. Second operand has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:18,061 INFO L93 Difference]: Finished difference Result 1283 states and 2158 transitions. [2021-12-16 00:41:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 00:41:18,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2021-12-16 00:41:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:18,065 INFO L225 Difference]: With dead ends: 1283 [2021-12-16 00:41:18,065 INFO L226 Difference]: Without dead ends: 804 [2021-12-16 00:41:18,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-16 00:41:18,068 INFO L933 BasicCegarLoop]: 891 mSDtfsCounter, 1817 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 4500 mSolverCounterSat, 640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 3748 SdHoareTripleChecker+Invalid, 5140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 640 IncrementalHoareTripleChecker+Valid, 4500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:18,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1897 Valid, 3748 Invalid, 5140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [640 Valid, 4500 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-16 00:41:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-12-16 00:41:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 537. [2021-12-16 00:41:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.6571428571428573) internal successors, (696), 439 states have internal predecessors, (696), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 879 transitions. [2021-12-16 00:41:18,106 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 879 transitions. Word has length 110 [2021-12-16 00:41:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:18,106 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 879 transitions. [2021-12-16 00:41:18,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 879 transitions. [2021-12-16 00:41:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-16 00:41:18,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:18,108 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:18,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 00:41:18,109 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash 103820333, now seen corresponding path program 1 times [2021-12-16 00:41:18,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:18,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128954191] [2021-12-16 00:41:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:18,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 00:41:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-16 00:41:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:18,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128954191] [2021-12-16 00:41:18,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128954191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:18,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:18,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 00:41:18,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856203765] [2021-12-16 00:41:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:18,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:41:18,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:41:18,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:18,422 INFO L87 Difference]: Start difference. First operand 537 states and 879 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:22,543 INFO L93 Difference]: Finished difference Result 1283 states and 2153 transitions. [2021-12-16 00:41:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 00:41:22,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2021-12-16 00:41:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:22,550 INFO L225 Difference]: With dead ends: 1283 [2021-12-16 00:41:22,550 INFO L226 Difference]: Without dead ends: 804 [2021-12-16 00:41:22,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-16 00:41:22,552 INFO L933 BasicCegarLoop]: 888 mSDtfsCounter, 1402 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 4523 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 3792 SdHoareTripleChecker+Invalid, 4998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 4523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:22,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1482 Valid, 3792 Invalid, 4998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 4523 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-16 00:41:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-12-16 00:41:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 537. [2021-12-16 00:41:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.6452380952380952) internal successors, (691), 439 states have internal predecessors, (691), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 874 transitions. [2021-12-16 00:41:22,589 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 874 transitions. Word has length 111 [2021-12-16 00:41:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:22,590 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 874 transitions. [2021-12-16 00:41:22,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 874 transitions. [2021-12-16 00:41:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-16 00:41:22,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:22,592 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:22,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 00:41:22,592 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1968979958, now seen corresponding path program 1 times [2021-12-16 00:41:22,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:22,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244423766] [2021-12-16 00:41:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:22,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 00:41:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 00:41:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:22,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:22,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244423766] [2021-12-16 00:41:22,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244423766] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:22,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:22,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 00:41:22,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180800077] [2021-12-16 00:41:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:22,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:41:22,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:22,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:41:22,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:22,904 INFO L87 Difference]: Start difference. First operand 537 states and 874 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:26,848 INFO L93 Difference]: Finished difference Result 1283 states and 2148 transitions. [2021-12-16 00:41:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 00:41:26,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2021-12-16 00:41:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:26,852 INFO L225 Difference]: With dead ends: 1283 [2021-12-16 00:41:26,852 INFO L226 Difference]: Without dead ends: 804 [2021-12-16 00:41:26,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-16 00:41:26,854 INFO L933 BasicCegarLoop]: 897 mSDtfsCounter, 1828 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 4423 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 5031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 4423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:26,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1908 Valid, 3793 Invalid, 5031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 4423 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-12-16 00:41:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-12-16 00:41:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 537. [2021-12-16 00:41:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.6333333333333333) internal successors, (686), 439 states have internal predecessors, (686), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 869 transitions. [2021-12-16 00:41:26,891 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 869 transitions. Word has length 112 [2021-12-16 00:41:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:26,892 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 869 transitions. [2021-12-16 00:41:26,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 869 transitions. [2021-12-16 00:41:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-16 00:41:26,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:26,895 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:26,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 00:41:26,895 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1329589909, now seen corresponding path program 1 times [2021-12-16 00:41:26,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:26,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652508189] [2021-12-16 00:41:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:26,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 00:41:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 00:41:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:27,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:27,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652508189] [2021-12-16 00:41:27,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652508189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:27,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:27,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 00:41:27,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738285986] [2021-12-16 00:41:27,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:27,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:41:27,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:27,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:41:27,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:27,179 INFO L87 Difference]: Start difference. First operand 537 states and 869 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:31,474 INFO L93 Difference]: Finished difference Result 1298 states and 2166 transitions. [2021-12-16 00:41:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 00:41:31,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2021-12-16 00:41:31,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:31,477 INFO L225 Difference]: With dead ends: 1298 [2021-12-16 00:41:31,477 INFO L226 Difference]: Without dead ends: 825 [2021-12-16 00:41:31,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-12-16 00:41:31,480 INFO L933 BasicCegarLoop]: 902 mSDtfsCounter, 1414 mSDsluCounter, 2907 mSDsCounter, 0 mSdLazyCounter, 4462 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 3809 SdHoareTripleChecker+Invalid, 4908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 4462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:31,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1494 Valid, 3809 Invalid, 4908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 4462 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-16 00:41:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-12-16 00:41:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 539. [2021-12-16 00:41:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.6303317535545023) internal successors, (688), 441 states have internal predecessors, (688), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 871 transitions. [2021-12-16 00:41:31,517 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 871 transitions. Word has length 112 [2021-12-16 00:41:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:31,518 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 871 transitions. [2021-12-16 00:41:31,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 871 transitions. [2021-12-16 00:41:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-16 00:41:31,521 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:31,521 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:31,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 00:41:31,521 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:31,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash 742443858, now seen corresponding path program 1 times [2021-12-16 00:41:31,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:31,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759846966] [2021-12-16 00:41:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:31,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 00:41:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 00:41:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:31,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:31,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759846966] [2021-12-16 00:41:31,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759846966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:31,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:31,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 00:41:31,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805667185] [2021-12-16 00:41:31,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:31,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:41:31,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:31,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:41:31,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:31,787 INFO L87 Difference]: Start difference. First operand 539 states and 871 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:35,709 INFO L93 Difference]: Finished difference Result 1289 states and 2149 transitions. [2021-12-16 00:41:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 00:41:35,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2021-12-16 00:41:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:35,713 INFO L225 Difference]: With dead ends: 1289 [2021-12-16 00:41:35,713 INFO L226 Difference]: Without dead ends: 808 [2021-12-16 00:41:35,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-16 00:41:35,715 INFO L933 BasicCegarLoop]: 894 mSDtfsCounter, 1410 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 4459 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 3820 SdHoareTripleChecker+Invalid, 4913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 4459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:35,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1490 Valid, 3820 Invalid, 4913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 4459 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-12-16 00:41:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2021-12-16 00:41:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 539. [2021-12-16 00:41:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 422 states have (on average 1.6184834123222749) internal successors, (683), 441 states have internal predecessors, (683), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 866 transitions. [2021-12-16 00:41:35,777 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 866 transitions. Word has length 113 [2021-12-16 00:41:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:35,778 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 866 transitions. [2021-12-16 00:41:35,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 866 transitions. [2021-12-16 00:41:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-16 00:41:35,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:35,780 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:35,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 00:41:35,781 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:35,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1641457, now seen corresponding path program 1 times [2021-12-16 00:41:35,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:35,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94950545] [2021-12-16 00:41:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:35,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:35,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 00:41:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 00:41:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:36,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:36,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94950545] [2021-12-16 00:41:36,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94950545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:36,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:36,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 00:41:36,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444639906] [2021-12-16 00:41:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:36,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:41:36,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:41:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:36,084 INFO L87 Difference]: Start difference. First operand 539 states and 866 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:40,548 INFO L93 Difference]: Finished difference Result 1302 states and 2163 transitions. [2021-12-16 00:41:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 00:41:40,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2021-12-16 00:41:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:40,554 INFO L225 Difference]: With dead ends: 1302 [2021-12-16 00:41:40,554 INFO L226 Difference]: Without dead ends: 829 [2021-12-16 00:41:40,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-12-16 00:41:40,556 INFO L933 BasicCegarLoop]: 901 mSDtfsCounter, 1404 mSDsluCounter, 2939 mSDsCounter, 0 mSdLazyCounter, 4510 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 3840 SdHoareTripleChecker+Invalid, 4949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 4510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:40,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 3840 Invalid, 4949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 4510 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-12-16 00:41:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2021-12-16 00:41:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 542. [2021-12-16 00:41:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 425 states have (on average 1.6141176470588234) internal successors, (686), 444 states have internal predecessors, (686), 94 states have call successors, (94), 23 states have call predecessors, (94), 22 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-16 00:41:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 869 transitions. [2021-12-16 00:41:40,598 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 869 transitions. Word has length 113 [2021-12-16 00:41:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:40,598 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 869 transitions. [2021-12-16 00:41:40,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 869 transitions. [2021-12-16 00:41:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-16 00:41:40,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:40,600 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:40,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 00:41:40,601 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:40,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1440959631, now seen corresponding path program 1 times [2021-12-16 00:41:40,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:40,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578600619] [2021-12-16 00:41:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:40,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 00:41:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 00:41:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:40,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:40,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578600619] [2021-12-16 00:41:40,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578600619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:40,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:40,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 00:41:40,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701450050] [2021-12-16 00:41:40,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:40,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:41:40,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:40,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:41:40,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:40,889 INFO L87 Difference]: Start difference. First operand 542 states and 869 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:41:45,355 INFO L93 Difference]: Finished difference Result 1298 states and 2155 transitions. [2021-12-16 00:41:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 00:41:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2021-12-16 00:41:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:41:45,374 INFO L225 Difference]: With dead ends: 1298 [2021-12-16 00:41:45,374 INFO L226 Difference]: Without dead ends: 828 [2021-12-16 00:41:45,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2021-12-16 00:41:45,379 INFO L933 BasicCegarLoop]: 925 mSDtfsCounter, 995 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 4650 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 3918 SdHoareTripleChecker+Invalid, 4922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 4650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-12-16 00:41:45,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1075 Valid, 3918 Invalid, 4922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 4650 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-12-16 00:41:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-12-16 00:41:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 553. [2021-12-16 00:41:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 433 states have (on average 1.6096997690531178) internal successors, (697), 454 states have internal predecessors, (697), 95 states have call successors, (95), 23 states have call predecessors, (95), 24 states have return successors, (92), 88 states have call predecessors, (92), 90 states have call successors, (92) [2021-12-16 00:41:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 884 transitions. [2021-12-16 00:41:45,427 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 884 transitions. Word has length 114 [2021-12-16 00:41:45,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:41:45,428 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 884 transitions. [2021-12-16 00:41:45,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 00:41:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 884 transitions. [2021-12-16 00:41:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-16 00:41:45,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:41:45,430 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:41:45,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 00:41:45,430 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:41:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:41:45,431 INFO L85 PathProgramCache]: Analyzing trace with hash -620255568, now seen corresponding path program 1 times [2021-12-16 00:41:45,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:41:45,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903966415] [2021-12-16 00:41:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:41:45,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:41:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:41:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-16 00:41:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-16 00:41:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:41:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 00:41:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:41:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:41:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 00:41:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:41:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 00:41:45,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:41:45,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903966415] [2021-12-16 00:41:45,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903966415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:41:45,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:41:45,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 00:41:45,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201725861] [2021-12-16 00:41:45,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:41:45,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 00:41:45,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:41:45,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 00:41:45,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-16 00:41:45,705 INFO L87 Difference]: Start difference. First operand 553 states and 884 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)