./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_product19.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 d96f41c83679efe744540e7fde7918287d6cc79be28bb1ad9b63bf8e0d07ce19 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 05:43:40,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 05:43:40,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 05:43:40,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 05:43:40,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 05:43:40,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 05:43:40,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 05:43:40,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 05:43:40,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 05:43:40,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 05:43:40,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 05:43:40,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 05:43:40,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 05:43:40,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 05:43:40,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 05:43:40,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 05:43:40,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 05:43:40,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 05:43:40,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 05:43:40,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 05:43:40,431 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 05:43:40,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 05:43:40,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 05:43:40,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 05:43:40,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 05:43:40,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 05:43:40,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 05:43:40,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 05:43:40,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 05:43:40,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 05:43:40,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 05:43:40,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 05:43:40,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 05:43:40,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 05:43:40,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 05:43:40,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 05:43:40,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 05:43:40,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 05:43:40,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 05:43:40,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 05:43:40,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 05:43:40,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 05:43:40,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 05:43:40,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 05:43:40,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 05:43:40,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 05:43:40,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 05:43:40,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 05:43:40,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 05:43:40,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 05:43:40,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 05:43:40,486 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 05:43:40,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 05:43:40,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 05:43:40,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 05:43:40,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 05:43:40,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 05:43:40,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 05:43:40,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 05:43:40,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 05:43:40,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 05:43:40,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 05:43:40,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 05:43:40,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 05:43:40,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 05:43:40,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 05:43:40,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 05:43:40,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:43:40,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 05:43:40,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 05:43:40,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 05:43:40,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 05:43:40,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 05:43:40,493 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 05:43:40,493 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 05:43:40,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 05:43:40,493 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 -> d96f41c83679efe744540e7fde7918287d6cc79be28bb1ad9b63bf8e0d07ce19 [2022-07-12 05:43:40,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 05:43:40,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 05:43:40,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 05:43:40,772 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 05:43:40,773 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 05:43:40,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c [2022-07-12 05:43:40,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794a5100b/ff84f8f583ec43ca8471ddf199f9cd6d/FLAGeaae382a9 [2022-07-12 05:43:41,411 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 05:43:41,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c [2022-07-12 05:43:41,438 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794a5100b/ff84f8f583ec43ca8471ddf199f9cd6d/FLAGeaae382a9 [2022-07-12 05:43:41,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794a5100b/ff84f8f583ec43ca8471ddf199f9cd6d [2022-07-12 05:43:41,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 05:43:41,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 05:43:41,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 05:43:41,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 05:43:41,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 05:43:41,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:43:41" (1/1) ... [2022-07-12 05:43:41,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28df1fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:41, skipping insertion in model container [2022-07-12 05:43:41,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:43:41" (1/1) ... [2022-07-12 05:43:41,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 05:43:41,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 05:43:42,223 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_product19.cil.c[34453,34466] [2022-07-12 05:43:42,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:43:42,340 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 05:43:42,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_product19.cil.c[34453,34466] [2022-07-12 05:43:42,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 05:43:42,453 INFO L208 MainTranslator]: Completed translation [2022-07-12 05:43:42,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42 WrapperNode [2022-07-12 05:43:42,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 05:43:42,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 05:43:42,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 05:43:42,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 05:43:42,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,537 INFO L137 Inliner]: procedures = 94, calls = 340, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1119 [2022-07-12 05:43:42,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 05:43:42,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 05:43:42,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 05:43:42,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 05:43:42,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 05:43:42,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 05:43:42,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 05:43:42,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 05:43:42,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (1/1) ... [2022-07-12 05:43:42,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 05:43:42,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:43:42,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 05:43:42,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 05:43:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 05:43:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2022-07-12 05:43:42,687 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2022-07-12 05:43:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2022-07-12 05:43:42,688 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2022-07-12 05:43:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2022-07-12 05:43:42,688 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2022-07-12 05:43:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2022-07-12 05:43:42,690 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2022-07-12 05:43:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2022-07-12 05:43:42,690 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2022-07-12 05:43:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2022-07-12 05:43:42,691 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2022-07-12 05:43:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2022-07-12 05:43:42,691 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2022-07-12 05:43:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-07-12 05:43:42,691 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-07-12 05:43:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-07-12 05:43:42,692 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-07-12 05:43:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2022-07-12 05:43:42,692 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2022-07-12 05:43:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2022-07-12 05:43:42,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2022-07-12 05:43:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2022-07-12 05:43:42,692 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2022-07-12 05:43:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2022-07-12 05:43:42,693 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2022-07-12 05:43:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2022-07-12 05:43:42,693 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2022-07-12 05:43:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2022-07-12 05:43:42,693 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2022-07-12 05:43:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2022-07-12 05:43:42,694 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2022-07-12 05:43:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2022-07-12 05:43:42,694 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2022-07-12 05:43:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2022-07-12 05:43:42,695 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2022-07-12 05:43:42,695 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2022-07-12 05:43:42,695 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2022-07-12 05:43:42,695 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2022-07-12 05:43:42,695 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2022-07-12 05:43:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 05:43:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2022-07-12 05:43:42,696 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2022-07-12 05:43:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2022-07-12 05:43:42,696 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2022-07-12 05:43:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2022-07-12 05:43:42,697 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2022-07-12 05:43:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 05:43:42,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 05:43:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2022-07-12 05:43:42,698 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2022-07-12 05:43:42,879 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 05:43:42,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 05:43:43,769 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 05:43:43,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 05:43:43,786 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 05:43:43,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:43:43 BoogieIcfgContainer [2022-07-12 05:43:43,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 05:43:43,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 05:43:43,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 05:43:43,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 05:43:43,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:43:41" (1/3) ... [2022-07-12 05:43:43,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778b5a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:43:43, skipping insertion in model container [2022-07-12 05:43:43,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:43:42" (2/3) ... [2022-07-12 05:43:43,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778b5a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:43:43, skipping insertion in model container [2022-07-12 05:43:43,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:43:43" (3/3) ... [2022-07-12 05:43:43,801 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product19.cil.c [2022-07-12 05:43:43,815 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 05:43:43,815 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 05:43:43,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 05:43:43,888 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@321de0c9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1575e942 [2022-07-12 05:43:43,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 05:43:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 560 states, 438 states have (on average 1.6894977168949772) internal successors, (740), 459 states have internal predecessors, (740), 96 states have call successors, (96), 24 states have call predecessors, (96), 24 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-07-12 05:43:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 05:43:43,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:43:43,947 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:43:43,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:43:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:43:43,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1065418536, now seen corresponding path program 1 times [2022-07-12 05:43:43,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:43:43,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300061353] [2022-07-12 05:43:43,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:43:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:43:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:43:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 05:43:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 05:43:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:43:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:43:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:43:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:43:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:43:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:43:44,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300061353] [2022-07-12 05:43:44,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300061353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:43:44,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:43:44,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:43:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539253535] [2022-07-12 05:43:44,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:43:44,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:43:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:43:44,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:43:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:43:44,848 INFO L87 Difference]: Start difference. First operand has 560 states, 438 states have (on average 1.6894977168949772) internal successors, (740), 459 states have internal predecessors, (740), 96 states have call successors, (96), 24 states have call predecessors, (96), 24 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) 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) [2022-07-12 05:43:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:43:50,038 INFO L93 Difference]: Finished difference Result 1361 states and 2301 transitions. [2022-07-12 05:43:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:43:50,041 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 [2022-07-12 05:43:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:43:50,062 INFO L225 Difference]: With dead ends: 1361 [2022-07-12 05:43:50,062 INFO L226 Difference]: Without dead ends: 813 [2022-07-12 05:43:50,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:43:50,078 INFO L413 NwaCegarLoop]: 976 mSDtfsCounter, 1390 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 2499 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 2499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 05:43:50,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 2361 Invalid, 2922 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [423 Valid, 2499 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 05:43:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-12 05:43:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 552. [2022-07-12 05:43:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 432 states have (on average 1.6851851851851851) internal successors, (728), 451 states have internal predecessors, (728), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2022-07-12 05:43:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 915 transitions. [2022-07-12 05:43:50,262 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 915 transitions. Word has length 102 [2022-07-12 05:43:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:43:50,263 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 915 transitions. [2022-07-12 05:43:50,263 INFO L496 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) [2022-07-12 05:43:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 915 transitions. [2022-07-12 05:43:50,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 05:43:50,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:43:50,270 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:43:50,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 05:43:50,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:43:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:43:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1233827054, now seen corresponding path program 1 times [2022-07-12 05:43:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:43:50,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361450886] [2022-07-12 05:43:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:43:50,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:43:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:43:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:43:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 05:43:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:43:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:43:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:43:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:43:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:43:50,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:43:50,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361450886] [2022-07-12 05:43:50,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361450886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:43:50,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:43:50,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:43:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658317249] [2022-07-12 05:43:50,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:43:50,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:43:50,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:43:50,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:43:50,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:43:50,695 INFO L87 Difference]: Start difference. First operand 552 states and 915 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) [2022-07-12 05:43:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:43:55,269 INFO L93 Difference]: Finished difference Result 1347 states and 2263 transitions. [2022-07-12 05:43:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:43:55,272 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 [2022-07-12 05:43:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:43:55,278 INFO L225 Difference]: With dead ends: 1347 [2022-07-12 05:43:55,278 INFO L226 Difference]: Without dead ends: 813 [2022-07-12 05:43:55,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:43:55,282 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 1383 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:43:55,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 2337 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 05:43:55,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-12 05:43:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 552. [2022-07-12 05:43:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 432 states have (on average 1.6828703703703705) internal successors, (727), 451 states have internal predecessors, (727), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2022-07-12 05:43:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 914 transitions. [2022-07-12 05:43:55,344 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 914 transitions. Word has length 105 [2022-07-12 05:43:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:43:55,344 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 914 transitions. [2022-07-12 05:43:55,344 INFO L496 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) [2022-07-12 05:43:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 914 transitions. [2022-07-12 05:43:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 05:43:55,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:43:55,348 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:43:55,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 05:43:55,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:43:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:43:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 618878632, now seen corresponding path program 1 times [2022-07-12 05:43:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:43:55,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046807053] [2022-07-12 05:43:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:43:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:43:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:43:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 05:43:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 05:43:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:43:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:43:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:43:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:43:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:43:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:43:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:43:55,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:43:55,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046807053] [2022-07-12 05:43:55,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046807053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:43:55,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:43:55,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:43:55,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675732917] [2022-07-12 05:43:55,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:43:55,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:43:55,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:43:55,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:43:55,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:43:55,754 INFO L87 Difference]: Start difference. First operand 552 states and 914 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) [2022-07-12 05:44:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:00,096 INFO L93 Difference]: Finished difference Result 1347 states and 2262 transitions. [2022-07-12 05:44:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:44:00,097 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 [2022-07-12 05:44:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:00,102 INFO L225 Difference]: With dead ends: 1347 [2022-07-12 05:44:00,103 INFO L226 Difference]: Without dead ends: 813 [2022-07-12 05:44:00,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:44:00,106 INFO L413 NwaCegarLoop]: 967 mSDtfsCounter, 952 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 2580 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:00,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 2380 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2580 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 05:44:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-12 05:44:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 552. [2022-07-12 05:44:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 432 states have (on average 1.6805555555555556) internal successors, (726), 451 states have internal predecessors, (726), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2022-07-12 05:44:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 913 transitions. [2022-07-12 05:44:00,181 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 913 transitions. Word has length 106 [2022-07-12 05:44:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:00,183 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 913 transitions. [2022-07-12 05:44:00,183 INFO L496 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) [2022-07-12 05:44:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 913 transitions. [2022-07-12 05:44:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 05:44:00,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:00,190 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:00,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 05:44:00,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2133787826, now seen corresponding path program 1 times [2022-07-12 05:44:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:00,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5822010] [2022-07-12 05:44:00,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 05:44:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 05:44:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:00,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5822010] [2022-07-12 05:44:00,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5822010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:00,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:00,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:44:00,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499305761] [2022-07-12 05:44:00,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:00,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:44:00,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:00,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:44:00,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:44:00,626 INFO L87 Difference]: Start difference. First operand 552 states and 913 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) [2022-07-12 05:44:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:04,464 INFO L93 Difference]: Finished difference Result 1347 states and 2261 transitions. [2022-07-12 05:44:04,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:44:04,464 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 [2022-07-12 05:44:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:04,470 INFO L225 Difference]: With dead ends: 1347 [2022-07-12 05:44:04,470 INFO L226 Difference]: Without dead ends: 813 [2022-07-12 05:44:04,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:44:04,474 INFO L413 NwaCegarLoop]: 971 mSDtfsCounter, 1814 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:04,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 2267 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 05:44:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-12 05:44:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 552. [2022-07-12 05:44:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 432 states have (on average 1.6782407407407407) internal successors, (725), 451 states have internal predecessors, (725), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2022-07-12 05:44:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 912 transitions. [2022-07-12 05:44:04,535 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 912 transitions. Word has length 107 [2022-07-12 05:44:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:04,535 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 912 transitions. [2022-07-12 05:44:04,535 INFO L496 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) [2022-07-12 05:44:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 912 transitions. [2022-07-12 05:44:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 05:44:04,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:04,539 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:04,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 05:44:04,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1624102684, now seen corresponding path program 1 times [2022-07-12 05:44:04,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:04,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045221656] [2022-07-12 05:44:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:04,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 05:44:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 05:44:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:04,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:04,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045221656] [2022-07-12 05:44:04,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045221656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:04,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:04,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:44:04,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522085720] [2022-07-12 05:44:04,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:04,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:44:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:04,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:44:04,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:44:04,913 INFO L87 Difference]: Start difference. First operand 552 states and 912 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) [2022-07-12 05:44:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:08,603 INFO L93 Difference]: Finished difference Result 1347 states and 2260 transitions. [2022-07-12 05:44:08,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:44:08,604 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 [2022-07-12 05:44:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:08,609 INFO L225 Difference]: With dead ends: 1347 [2022-07-12 05:44:08,610 INFO L226 Difference]: Without dead ends: 813 [2022-07-12 05:44:08,613 INFO L412 NwaCegarLoop]: 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 [2022-07-12 05:44:08,614 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 1815 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:08,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 2249 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 05:44:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-07-12 05:44:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 552. [2022-07-12 05:44:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 432 states have (on average 1.6759259259259258) internal successors, (724), 451 states have internal predecessors, (724), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2022-07-12 05:44:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 911 transitions. [2022-07-12 05:44:08,688 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 911 transitions. Word has length 108 [2022-07-12 05:44:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:08,689 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 911 transitions. [2022-07-12 05:44:08,689 INFO L496 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) [2022-07-12 05:44:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 911 transitions. [2022-07-12 05:44:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 05:44:08,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:08,693 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:08,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 05:44:08,694 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1234234250, now seen corresponding path program 1 times [2022-07-12 05:44:08,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:08,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559264989] [2022-07-12 05:44:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:08,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:08,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:08,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:44:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:09,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:09,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559264989] [2022-07-12 05:44:09,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559264989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:09,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:09,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 05:44:09,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703574765] [2022-07-12 05:44:09,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:09,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 05:44:09,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:09,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 05:44:09,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 05:44:09,135 INFO L87 Difference]: Start difference. First operand 552 states and 911 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 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) [2022-07-12 05:44:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:15,340 INFO L93 Difference]: Finished difference Result 1324 states and 2210 transitions. [2022-07-12 05:44:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 05:44:15,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 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 [2022-07-12 05:44:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:15,346 INFO L225 Difference]: With dead ends: 1324 [2022-07-12 05:44:15,346 INFO L226 Difference]: Without dead ends: 839 [2022-07-12 05:44:15,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2022-07-12 05:44:15,352 INFO L413 NwaCegarLoop]: 968 mSDtfsCounter, 1096 mSDsluCounter, 3720 mSDsCounter, 0 mSdLazyCounter, 6642 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 4688 SdHoareTripleChecker+Invalid, 6933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 6642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:15,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 4688 Invalid, 6933 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [291 Valid, 6642 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-12 05:44:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-12 05:44:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 565. [2022-07-12 05:44:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.6719457013574661) internal successors, (739), 463 states have internal predecessors, (739), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2022-07-12 05:44:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 930 transitions. [2022-07-12 05:44:15,428 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 930 transitions. Word has length 109 [2022-07-12 05:44:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:15,429 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 930 transitions. [2022-07-12 05:44:15,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 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) [2022-07-12 05:44:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 930 transitions. [2022-07-12 05:44:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 05:44:15,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:15,434 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:15,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 05:44:15,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:15,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1219984105, now seen corresponding path program 1 times [2022-07-12 05:44:15,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:15,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475190935] [2022-07-12 05:44:15,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 05:44:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:15,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475190935] [2022-07-12 05:44:15,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475190935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:15,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:15,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:44:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634309897] [2022-07-12 05:44:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:15,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:44:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:44:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:44:15,830 INFO L87 Difference]: Start difference. First operand 565 states and 930 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 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) [2022-07-12 05:44:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:20,139 INFO L93 Difference]: Finished difference Result 1338 states and 2233 transitions. [2022-07-12 05:44:20,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:44:20,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 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 109 [2022-07-12 05:44:20,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:20,144 INFO L225 Difference]: With dead ends: 1338 [2022-07-12 05:44:20,144 INFO L226 Difference]: Without dead ends: 835 [2022-07-12 05:44:20,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:44:20,148 INFO L413 NwaCegarLoop]: 917 mSDtfsCounter, 995 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:20,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 2339 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 05:44:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-07-12 05:44:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 565. [2022-07-12 05:44:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.660633484162896) internal successors, (734), 463 states have internal predecessors, (734), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2022-07-12 05:44:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 925 transitions. [2022-07-12 05:44:20,221 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 925 transitions. Word has length 109 [2022-07-12 05:44:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:20,221 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 925 transitions. [2022-07-12 05:44:20,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 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) [2022-07-12 05:44:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 925 transitions. [2022-07-12 05:44:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-12 05:44:20,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:20,225 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:20,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 05:44:20,225 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:20,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1734696347, now seen corresponding path program 1 times [2022-07-12 05:44:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:20,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909197234] [2022-07-12 05:44:20,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 05:44:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:20,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:20,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909197234] [2022-07-12 05:44:20,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909197234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:20,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:20,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:44:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134624362] [2022-07-12 05:44:20,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:20,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:44:20,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:20,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:44:20,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:44:20,562 INFO L87 Difference]: Start difference. First operand 565 states and 925 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 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) [2022-07-12 05:44:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:24,648 INFO L93 Difference]: Finished difference Result 1338 states and 2228 transitions. [2022-07-12 05:44:24,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:44:24,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 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 110 [2022-07-12 05:44:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:24,653 INFO L225 Difference]: With dead ends: 1338 [2022-07-12 05:44:24,653 INFO L226 Difference]: Without dead ends: 835 [2022-07-12 05:44:24,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:44:24,656 INFO L413 NwaCegarLoop]: 911 mSDtfsCounter, 994 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:24,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 2321 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 05:44:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-07-12 05:44:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 565. [2022-07-12 05:44:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.6493212669683257) internal successors, (729), 463 states have internal predecessors, (729), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2022-07-12 05:44:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 920 transitions. [2022-07-12 05:44:24,748 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 920 transitions. Word has length 110 [2022-07-12 05:44:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:24,749 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 920 transitions. [2022-07-12 05:44:24,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 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) [2022-07-12 05:44:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 920 transitions. [2022-07-12 05:44:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 05:44:24,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:24,752 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:24,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 05:44:24,753 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1240337234, now seen corresponding path program 1 times [2022-07-12 05:44:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:24,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399346854] [2022-07-12 05:44:24,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:24,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 05:44:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:25,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:25,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399346854] [2022-07-12 05:44:25,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399346854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:25,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:25,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:44:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126838619] [2022-07-12 05:44:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:25,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:44:25,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:44:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:44:25,117 INFO L87 Difference]: Start difference. First operand 565 states and 920 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 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) [2022-07-12 05:44:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:29,142 INFO L93 Difference]: Finished difference Result 1338 states and 2223 transitions. [2022-07-12 05:44:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:44:29,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 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 111 [2022-07-12 05:44:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:29,148 INFO L225 Difference]: With dead ends: 1338 [2022-07-12 05:44:29,148 INFO L226 Difference]: Without dead ends: 835 [2022-07-12 05:44:29,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:44:29,150 INFO L413 NwaCegarLoop]: 909 mSDtfsCounter, 993 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:29,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 2313 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 05:44:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-07-12 05:44:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 565. [2022-07-12 05:44:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.6380090497737556) internal successors, (724), 463 states have internal predecessors, (724), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2022-07-12 05:44:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 915 transitions. [2022-07-12 05:44:29,248 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 915 transitions. Word has length 111 [2022-07-12 05:44:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:29,250 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 915 transitions. [2022-07-12 05:44:29,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 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) [2022-07-12 05:44:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 915 transitions. [2022-07-12 05:44:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 05:44:29,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:29,255 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:29,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 05:44:29,256 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:29,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash -764644192, now seen corresponding path program 1 times [2022-07-12 05:44:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:29,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418504390] [2022-07-12 05:44:29,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 05:44:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418504390] [2022-07-12 05:44:29,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418504390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:29,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:29,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:44:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826504396] [2022-07-12 05:44:29,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:29,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:44:29,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:44:29,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:44:29,618 INFO L87 Difference]: Start difference. First operand 565 states and 915 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) [2022-07-12 05:44:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:35,128 INFO L93 Difference]: Finished difference Result 1330 states and 2200 transitions. [2022-07-12 05:44:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 05:44:35,129 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 [2022-07-12 05:44:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:35,132 INFO L225 Difference]: With dead ends: 1330 [2022-07-12 05:44:35,132 INFO L226 Difference]: Without dead ends: 842 [2022-07-12 05:44:35,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-12 05:44:35,134 INFO L413 NwaCegarLoop]: 937 mSDtfsCounter, 1001 mSDsluCounter, 2844 mSDsCounter, 0 mSdLazyCounter, 4932 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 3781 SdHoareTripleChecker+Invalid, 5218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 4932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:35,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 3781 Invalid, 5218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 4932 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 05:44:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-12 05:44:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 565. [2022-07-12 05:44:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.6357466063348416) internal successors, (723), 463 states have internal predecessors, (723), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2022-07-12 05:44:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 914 transitions. [2022-07-12 05:44:35,216 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 914 transitions. Word has length 112 [2022-07-12 05:44:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:35,217 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 914 transitions. [2022-07-12 05:44:35,217 INFO L496 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) [2022-07-12 05:44:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 914 transitions. [2022-07-12 05:44:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 05:44:35,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:35,220 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:35,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 05:44:35,221 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:35,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash -728341632, now seen corresponding path program 1 times [2022-07-12 05:44:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:35,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412261735] [2022-07-12 05:44:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:35,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 05:44:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:35,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:35,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412261735] [2022-07-12 05:44:35,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412261735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:35,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:35,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:44:35,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652208049] [2022-07-12 05:44:35,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:35,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:44:35,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:44:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:44:35,567 INFO L87 Difference]: Start difference. First operand 565 states and 914 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 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) [2022-07-12 05:44:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:38,981 INFO L93 Difference]: Finished difference Result 1338 states and 2215 transitions. [2022-07-12 05:44:38,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:44:38,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 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 112 [2022-07-12 05:44:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:38,986 INFO L225 Difference]: With dead ends: 1338 [2022-07-12 05:44:38,986 INFO L226 Difference]: Without dead ends: 835 [2022-07-12 05:44:38,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:44:38,988 INFO L413 NwaCegarLoop]: 920 mSDtfsCounter, 1871 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 2208 mSolverCounterSat, 610 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1952 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 610 IncrementalHoareTripleChecker+Valid, 2208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:38,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1952 Valid, 2219 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [610 Valid, 2208 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-12 05:44:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-07-12 05:44:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 565. [2022-07-12 05:44:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.6244343891402715) internal successors, (718), 463 states have internal predecessors, (718), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2022-07-12 05:44:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 909 transitions. [2022-07-12 05:44:39,073 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 909 transitions. Word has length 112 [2022-07-12 05:44:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:39,074 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 909 transitions. [2022-07-12 05:44:39,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 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) [2022-07-12 05:44:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 909 transitions. [2022-07-12 05:44:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 05:44:39,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:39,077 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:39,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 05:44:39,077 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:39,078 INFO L85 PathProgramCache]: Analyzing trace with hash 291656529, now seen corresponding path program 1 times [2022-07-12 05:44:39,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:39,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418788101] [2022-07-12 05:44:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 05:44:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418788101] [2022-07-12 05:44:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418788101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:39,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:39,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:44:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432229154] [2022-07-12 05:44:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:39,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:44:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:44:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:44:39,406 INFO L87 Difference]: Start difference. First operand 565 states and 909 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) [2022-07-12 05:44:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:44,711 INFO L93 Difference]: Finished difference Result 1351 states and 2225 transitions. [2022-07-12 05:44:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 05:44:44,712 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 [2022-07-12 05:44:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:44,716 INFO L225 Difference]: With dead ends: 1351 [2022-07-12 05:44:44,716 INFO L226 Difference]: Without dead ends: 860 [2022-07-12 05:44:44,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-12 05:44:44,719 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1014 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 4817 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 3742 SdHoareTripleChecker+Invalid, 5114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 4817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:44,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 3742 Invalid, 5114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 4817 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 05:44:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-07-12 05:44:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 568. [2022-07-12 05:44:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 445 states have (on average 1.6179775280898876) internal successors, (720), 466 states have internal predecessors, (720), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2022-07-12 05:44:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 911 transitions. [2022-07-12 05:44:44,821 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 911 transitions. Word has length 113 [2022-07-12 05:44:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:44,822 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 911 transitions. [2022-07-12 05:44:44,822 INFO L496 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) [2022-07-12 05:44:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 911 transitions. [2022-07-12 05:44:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 05:44:44,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:44,825 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:44,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 05:44:44,826 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 507376243, now seen corresponding path program 1 times [2022-07-12 05:44:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:44,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24893825] [2022-07-12 05:44:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:44,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:44,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:44,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 05:44:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:45,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:45,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24893825] [2022-07-12 05:44:45,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24893825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:45,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:45,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:44:45,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365070881] [2022-07-12 05:44:45,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:45,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:44:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:45,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:44:45,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:44:45,143 INFO L87 Difference]: Start difference. First operand 568 states and 911 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 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) [2022-07-12 05:44:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:48,583 INFO L93 Difference]: Finished difference Result 1347 states and 2216 transitions. [2022-07-12 05:44:48,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 05:44:48,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 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 113 [2022-07-12 05:44:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:48,588 INFO L225 Difference]: With dead ends: 1347 [2022-07-12 05:44:48,589 INFO L226 Difference]: Without dead ends: 841 [2022-07-12 05:44:48,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:44:48,591 INFO L413 NwaCegarLoop]: 910 mSDtfsCounter, 1444 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:48,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 2243 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 05:44:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-07-12 05:44:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 568. [2022-07-12 05:44:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 445 states have (on average 1.6067415730337078) internal successors, (715), 466 states have internal predecessors, (715), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2022-07-12 05:44:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 906 transitions. [2022-07-12 05:44:48,684 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 906 transitions. Word has length 113 [2022-07-12 05:44:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:48,685 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 906 transitions. [2022-07-12 05:44:48,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 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) [2022-07-12 05:44:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 906 transitions. [2022-07-12 05:44:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 05:44:48,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:48,688 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:48,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 05:44:48,689 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:48,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:48,689 INFO L85 PathProgramCache]: Analyzing trace with hash -158102651, now seen corresponding path program 1 times [2022-07-12 05:44:48,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:48,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997911012] [2022-07-12 05:44:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:48,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:48,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:44:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:49,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:49,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997911012] [2022-07-12 05:44:49,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997911012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:49,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:49,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:44:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076459287] [2022-07-12 05:44:49,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:49,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:44:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:49,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:44:49,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:44:49,047 INFO L87 Difference]: Start difference. First operand 568 states and 906 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) [2022-07-12 05:44:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:54,188 INFO L93 Difference]: Finished difference Result 1357 states and 2222 transitions. [2022-07-12 05:44:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 05:44:54,189 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), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2022-07-12 05:44:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:54,192 INFO L225 Difference]: With dead ends: 1357 [2022-07-12 05:44:54,192 INFO L226 Difference]: Without dead ends: 866 [2022-07-12 05:44:54,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-12 05:44:54,194 INFO L413 NwaCegarLoop]: 925 mSDtfsCounter, 1434 mSDsluCounter, 2782 mSDsCounter, 0 mSdLazyCounter, 4689 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 3707 SdHoareTripleChecker+Invalid, 5142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 4689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:54,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 3707 Invalid, 5142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 4689 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 05:44:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-07-12 05:44:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 572. [2022-07-12 05:44:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.599109131403118) internal successors, (718), 470 states have internal predecessors, (718), 97 states have call successors, (97), 24 states have call predecessors, (97), 25 states have return successors, (94), 90 states have call predecessors, (94), 92 states have call successors, (94) [2022-07-12 05:44:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 909 transitions. [2022-07-12 05:44:54,277 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 909 transitions. Word has length 114 [2022-07-12 05:44:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:54,278 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 909 transitions. [2022-07-12 05:44:54,278 INFO L496 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), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 05:44:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 909 transitions. [2022-07-12 05:44:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 05:44:54,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:54,281 INFO L195 NwaCegarLoop]: 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] [2022-07-12 05:44:54,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 05:44:54,282 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:54,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:54,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1591319195, now seen corresponding path program 1 times [2022-07-12 05:44:54,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:54,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854638205] [2022-07-12 05:44:54,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:54,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 05:44:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:54,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:54,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854638205] [2022-07-12 05:44:54,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854638205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:54,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:54,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:44:54,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671991672] [2022-07-12 05:44:54,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:54,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:44:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:54,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:44:54,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:44:54,602 INFO L87 Difference]: Start difference. First operand 572 states and 909 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 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) [2022-07-12 05:44:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:44:58,548 INFO L93 Difference]: Finished difference Result 1395 states and 2261 transitions. [2022-07-12 05:44:58,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 05:44:58,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 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 114 [2022-07-12 05:44:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:44:58,552 INFO L225 Difference]: With dead ends: 1395 [2022-07-12 05:44:58,552 INFO L226 Difference]: Without dead ends: 821 [2022-07-12 05:44:58,554 INFO L412 NwaCegarLoop]: 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 [2022-07-12 05:44:58,554 INFO L413 NwaCegarLoop]: 928 mSDtfsCounter, 918 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 05:44:58,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 2328 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 05:44:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-07-12 05:44:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 553. [2022-07-12 05:44:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 433 states have (on average 1.6073903002309469) internal successors, (696), 452 states have internal predecessors, (696), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2022-07-12 05:44:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 883 transitions. [2022-07-12 05:44:58,647 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 883 transitions. Word has length 114 [2022-07-12 05:44:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:44:58,648 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 883 transitions. [2022-07-12 05:44:58,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 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) [2022-07-12 05:44:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 883 transitions. [2022-07-12 05:44:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 05:44:58,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:44:58,651 INFO L195 NwaCegarLoop]: 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, 1] [2022-07-12 05:44:58,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 05:44:58,651 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:44:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:44:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash -51078506, now seen corresponding path program 1 times [2022-07-12 05:44:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:44:58,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020060743] [2022-07-12 05:44:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:44:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:44:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:44:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:44:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 05:44:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:44:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:44:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:44:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:44:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:44:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:44:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:44:58,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:44:58,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020060743] [2022-07-12 05:44:58,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020060743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:44:58,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:44:58,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:44:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290013267] [2022-07-12 05:44:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:44:58,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:44:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:44:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:44:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:44:58,964 INFO L87 Difference]: Start difference. First operand 553 states and 883 transitions. Second operand has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 6 states have internal predecessors, (80), 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) [2022-07-12 05:45:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:45:03,582 INFO L93 Difference]: Finished difference Result 1330 states and 2176 transitions. [2022-07-12 05:45:03,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 05:45:03,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 6 states have internal predecessors, (80), 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 115 [2022-07-12 05:45:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:45:03,586 INFO L225 Difference]: With dead ends: 1330 [2022-07-12 05:45:03,586 INFO L226 Difference]: Without dead ends: 842 [2022-07-12 05:45:03,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-12 05:45:03,588 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 1827 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 4458 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 5047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 4458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 05:45:03,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 3674 Invalid, 5047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 4458 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 05:45:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-12 05:45:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 558. [2022-07-12 05:45:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 438 states have (on average 1.6004566210045663) internal successors, (701), 457 states have internal predecessors, (701), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2022-07-12 05:45:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 888 transitions. [2022-07-12 05:45:03,677 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 888 transitions. Word has length 115 [2022-07-12 05:45:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:45:03,677 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 888 transitions. [2022-07-12 05:45:03,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 6 states have internal predecessors, (80), 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) [2022-07-12 05:45:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 888 transitions. [2022-07-12 05:45:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 05:45:03,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:45:03,680 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-07-12 05:45:03,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 05:45:03,681 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:45:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:45:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash -103270278, now seen corresponding path program 1 times [2022-07-12 05:45:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:45:03,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445336703] [2022-07-12 05:45:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:45:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:45:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:45:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:45:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:03,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:45:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:03,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:04,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:04,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 05:45:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:04,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 05:45:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:04,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:45:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:04,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:45:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 05:45:04,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:45:04,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445336703] [2022-07-12 05:45:04,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445336703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:45:04,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:45:04,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 05:45:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91371930] [2022-07-12 05:45:04,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:45:04,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 05:45:04,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:45:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 05:45:04,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 05:45:04,094 INFO L87 Difference]: Start difference. First operand 558 states and 888 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:45:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:45:12,583 INFO L93 Difference]: Finished difference Result 1583 states and 2703 transitions. [2022-07-12 05:45:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 05:45:12,584 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2022-07-12 05:45:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:45:12,590 INFO L225 Difference]: With dead ends: 1583 [2022-07-12 05:45:12,591 INFO L226 Difference]: Without dead ends: 1103 [2022-07-12 05:45:12,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2022-07-12 05:45:12,594 INFO L413 NwaCegarLoop]: 1020 mSDtfsCounter, 3919 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 9535 mSolverCounterSat, 1992 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3919 SdHoareTripleChecker+Valid, 4505 SdHoareTripleChecker+Invalid, 11527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1992 IncrementalHoareTripleChecker+Valid, 9535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-12 05:45:12,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3919 Valid, 4505 Invalid, 11527 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1992 Valid, 9535 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-12 05:45:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2022-07-12 05:45:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 567. [2022-07-12 05:45:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 463 states have internal predecessors, (708), 96 states have call successors, (96), 24 states have call predecessors, (96), 25 states have return successors, (110), 92 states have call predecessors, (110), 91 states have call successors, (110) [2022-07-12 05:45:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 914 transitions. [2022-07-12 05:45:12,698 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 914 transitions. Word has length 116 [2022-07-12 05:45:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:45:12,698 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 914 transitions. [2022-07-12 05:45:12,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:45:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 914 transitions. [2022-07-12 05:45:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 05:45:12,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:45:12,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:45:12,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 05:45:12,701 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:45:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:45:12,701 INFO L85 PathProgramCache]: Analyzing trace with hash 243649490, now seen corresponding path program 1 times [2022-07-12 05:45:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:45:12,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103216801] [2022-07-12 05:45:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:45:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:45:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:12,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:45:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:12,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:12,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:45:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:45:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:12,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:13,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:13,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 05:45:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:45:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:13,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 05:45:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:13,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 05:45:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 05:45:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:45:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103216801] [2022-07-12 05:45:13,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103216801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:45:13,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:45:13,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 05:45:13,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231130447] [2022-07-12 05:45:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:45:13,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 05:45:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:45:13,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 05:45:13,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 05:45:13,134 INFO L87 Difference]: Start difference. First operand 567 states and 914 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 9 states have internal predecessors, (82), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:45:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:45:31,050 INFO L93 Difference]: Finished difference Result 2553 states and 4531 transitions. [2022-07-12 05:45:31,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 05:45:31,051 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 9 states have internal predecessors, (82), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 118 [2022-07-12 05:45:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:45:31,070 INFO L225 Difference]: With dead ends: 2553 [2022-07-12 05:45:31,071 INFO L226 Difference]: Without dead ends: 2064 [2022-07-12 05:45:31,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 05:45:31,077 INFO L413 NwaCegarLoop]: 2012 mSDtfsCounter, 6627 mSDsluCounter, 7658 mSDsCounter, 0 mSdLazyCounter, 19344 mSolverCounterSat, 3374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6627 SdHoareTripleChecker+Valid, 9670 SdHoareTripleChecker+Invalid, 22718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3374 IncrementalHoareTripleChecker+Valid, 19344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2022-07-12 05:45:31,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6627 Valid, 9670 Invalid, 22718 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3374 Valid, 19344 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2022-07-12 05:45:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2022-07-12 05:45:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1348. [2022-07-12 05:45:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 986 states have (on average 1.6004056795131847) internal successors, (1578), 1043 states have internal predecessors, (1578), 305 states have call successors, (305), 44 states have call predecessors, (305), 56 states have return successors, (410), 308 states have call predecessors, (410), 300 states have call successors, (410) [2022-07-12 05:45:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2293 transitions. [2022-07-12 05:45:31,407 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2293 transitions. Word has length 118 [2022-07-12 05:45:31,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:45:31,407 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 2293 transitions. [2022-07-12 05:45:31,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 9 states have internal predecessors, (82), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:45:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2293 transitions. [2022-07-12 05:45:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 05:45:31,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:45:31,413 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-07-12 05:45:31,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 05:45:31,413 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:45:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:45:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash -790027358, now seen corresponding path program 1 times [2022-07-12 05:45:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:45:31,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200981992] [2022-07-12 05:45:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:45:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:45:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:45:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:45:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:45:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 05:45:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 05:45:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 05:45:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 05:45:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 05:45:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:45:31,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200981992] [2022-07-12 05:45:31,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200981992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:45:31,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325149396] [2022-07-12 05:45:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:45:31,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:45:31,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:45:31,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:45:31,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 05:45:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:32,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 05:45:32,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:45:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 05:45:32,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:45:32,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325149396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:45:32,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:45:32,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2022-07-12 05:45:32,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778568432] [2022-07-12 05:45:32,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:45:32,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 05:45:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:45:32,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 05:45:32,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-07-12 05:45:32,235 INFO L87 Difference]: Start difference. First operand 1348 states and 2293 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:45:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:45:33,111 INFO L93 Difference]: Finished difference Result 2623 states and 4546 transitions. [2022-07-12 05:45:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 05:45:33,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2022-07-12 05:45:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:45:33,121 INFO L225 Difference]: With dead ends: 2623 [2022-07-12 05:45:33,121 INFO L226 Difference]: Without dead ends: 1361 [2022-07-12 05:45:33,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-07-12 05:45:33,129 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 817 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 05:45:33,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 2193 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 05:45:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2022-07-12 05:45:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 577. [2022-07-12 05:45:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 453 states have (on average 1.5916114790286975) internal successors, (721), 472 states have internal predecessors, (721), 96 states have call successors, (96), 25 states have call predecessors, (96), 27 states have return successors, (111), 92 states have call predecessors, (111), 91 states have call successors, (111) [2022-07-12 05:45:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 928 transitions. [2022-07-12 05:45:33,321 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 928 transitions. Word has length 117 [2022-07-12 05:45:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:45:33,321 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 928 transitions. [2022-07-12 05:45:33,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:45:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 928 transitions. [2022-07-12 05:45:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 05:45:33,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:45:33,325 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:45:33,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 05:45:33,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:45:33,548 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:45:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:45:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1893765370, now seen corresponding path program 1 times [2022-07-12 05:45:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:45:33,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394230920] [2022-07-12 05:45:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:45:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:45:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:45:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:45:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:45:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 05:45:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 05:45:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 05:45:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:34,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 05:45:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 05:45:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:45:34,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394230920] [2022-07-12 05:45:34,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394230920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:45:34,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:45:34,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 05:45:34,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473165958] [2022-07-12 05:45:34,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:45:34,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 05:45:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:45:34,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 05:45:34,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 05:45:34,007 INFO L87 Difference]: Start difference. First operand 577 states and 928 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 9 states have internal predecessors, (83), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:45:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:45:52,765 INFO L93 Difference]: Finished difference Result 2580 states and 4547 transitions. [2022-07-12 05:45:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 05:45:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 9 states have internal predecessors, (83), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 120 [2022-07-12 05:45:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:45:52,780 INFO L225 Difference]: With dead ends: 2580 [2022-07-12 05:45:52,780 INFO L226 Difference]: Without dead ends: 2081 [2022-07-12 05:45:52,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 05:45:52,790 INFO L413 NwaCegarLoop]: 2064 mSDtfsCounter, 5663 mSDsluCounter, 8188 mSDsCounter, 0 mSdLazyCounter, 19256 mSolverCounterSat, 3107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5663 SdHoareTripleChecker+Valid, 10252 SdHoareTripleChecker+Invalid, 22363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3107 IncrementalHoareTripleChecker+Valid, 19256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:45:52,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5663 Valid, 10252 Invalid, 22363 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3107 Valid, 19256 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2022-07-12 05:45:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2022-07-12 05:45:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 1368. [2022-07-12 05:45:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1002 states have (on average 1.6007984031936129) internal successors, (1604), 1061 states have internal predecessors, (1604), 305 states have call successors, (305), 46 states have call predecessors, (305), 60 states have return successors, (406), 308 states have call predecessors, (406), 300 states have call successors, (406) [2022-07-12 05:45:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2315 transitions. [2022-07-12 05:45:53,209 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2315 transitions. Word has length 120 [2022-07-12 05:45:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:45:53,209 INFO L495 AbstractCegarLoop]: Abstraction has 1368 states and 2315 transitions. [2022-07-12 05:45:53,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 9 states have internal predecessors, (83), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:45:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2315 transitions. [2022-07-12 05:45:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 05:45:53,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:45:53,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:45:53,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 05:45:53,216 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:45:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:45:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1197558838, now seen corresponding path program 1 times [2022-07-12 05:45:53,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:45:53,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480653466] [2022-07-12 05:45:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:45:53,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:45:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:45:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:45:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:45:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 05:45:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:45:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:45:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 05:45:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:45:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:45:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 05:45:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:45:53,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480653466] [2022-07-12 05:45:53,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480653466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:45:53,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:45:53,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 05:45:53,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630997666] [2022-07-12 05:45:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:45:53,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 05:45:53,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:45:53,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 05:45:53,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 05:45:53,625 INFO L87 Difference]: Start difference. First operand 1368 states and 2315 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 9 states have internal predecessors, (84), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:46:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:46:11,637 INFO L93 Difference]: Finished difference Result 5409 states and 10057 transitions. [2022-07-12 05:46:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 05:46:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 9 states have internal predecessors, (84), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2022-07-12 05:46:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:46:11,691 INFO L225 Difference]: With dead ends: 5409 [2022-07-12 05:46:11,691 INFO L226 Difference]: Without dead ends: 4127 [2022-07-12 05:46:11,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 05:46:11,702 INFO L413 NwaCegarLoop]: 2051 mSDtfsCounter, 6577 mSDsluCounter, 7874 mSDsCounter, 0 mSdLazyCounter, 19165 mSolverCounterSat, 3395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6577 SdHoareTripleChecker+Valid, 9925 SdHoareTripleChecker+Invalid, 22560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3395 IncrementalHoareTripleChecker+Valid, 19165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:46:11,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6577 Valid, 9925 Invalid, 22560 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3395 Valid, 19165 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2022-07-12 05:46:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2022-07-12 05:46:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 2531. [2022-07-12 05:46:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 1743 states have (on average 1.5897877223178427) internal successors, (2771), 1873 states have internal predecessors, (2771), 691 states have call successors, (691), 67 states have call predecessors, (691), 96 states have return successors, (1044), 705 states have call predecessors, (1044), 686 states have call successors, (1044) [2022-07-12 05:46:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 4506 transitions. [2022-07-12 05:46:12,772 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 4506 transitions. Word has length 122 [2022-07-12 05:46:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:46:12,772 INFO L495 AbstractCegarLoop]: Abstraction has 2531 states and 4506 transitions. [2022-07-12 05:46:12,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 9 states have internal predecessors, (84), 4 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-12 05:46:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 4506 transitions. [2022-07-12 05:46:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 05:46:12,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:46:12,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:46:12,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 05:46:12,782 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:46:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:46:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -744074498, now seen corresponding path program 1 times [2022-07-12 05:46:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:46:12,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032829437] [2022-07-12 05:46:12,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:46:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:46:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:46:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:12,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:46:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:46:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 05:46:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 05:46:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 05:46:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 05:46:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 05:46:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:46:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032829437] [2022-07-12 05:46:13,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032829437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:46:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733121038] [2022-07-12 05:46:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:46:13,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:46:13,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:46:13,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:46:13,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 05:46:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:13,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 05:46:13,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:46:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 05:46:13,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:46:13,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733121038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:46:13,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:46:13,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2022-07-12 05:46:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757290038] [2022-07-12 05:46:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:46:13,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 05:46:13,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:46:13,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 05:46:13,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-12 05:46:13,653 INFO L87 Difference]: Start difference. First operand 2531 states and 4506 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:46:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:46:14,843 INFO L93 Difference]: Finished difference Result 4993 states and 8989 transitions. [2022-07-12 05:46:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 05:46:14,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2022-07-12 05:46:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:46:14,864 INFO L225 Difference]: With dead ends: 4993 [2022-07-12 05:46:14,865 INFO L226 Difference]: Without dead ends: 2556 [2022-07-12 05:46:14,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-07-12 05:46:14,883 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 807 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:46:14,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 2193 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 05:46:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-12 05:46:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2552. [2022-07-12 05:46:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 1760 states have (on average 1.5926136363636363) internal successors, (2803), 1894 states have internal predecessors, (2803), 691 states have call successors, (691), 70 states have call predecessors, (691), 100 states have return successors, (1031), 702 states have call predecessors, (1031), 686 states have call successors, (1031) [2022-07-12 05:46:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 4525 transitions. [2022-07-12 05:46:15,760 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 4525 transitions. Word has length 122 [2022-07-12 05:46:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:46:15,760 INFO L495 AbstractCegarLoop]: Abstraction has 2552 states and 4525 transitions. [2022-07-12 05:46:15,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:46:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 4525 transitions. [2022-07-12 05:46:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 05:46:15,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:46:15,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:46:15,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 05:46:15,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 05:46:15,968 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:46:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:46:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash 706267002, now seen corresponding path program 1 times [2022-07-12 05:46:15,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:46:15,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724417078] [2022-07-12 05:46:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:46:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:46:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:46:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:46:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:46:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 05:46:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 05:46:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 05:46:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 05:46:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 05:46:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:46:16,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724417078] [2022-07-12 05:46:16,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724417078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:46:16,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:46:16,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-12 05:46:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15361723] [2022-07-12 05:46:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:46:16,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 05:46:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:46:16,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 05:46:16,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-12 05:46:16,394 INFO L87 Difference]: Start difference. First operand 2552 states and 4525 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-12 05:46:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:46:36,954 INFO L93 Difference]: Finished difference Result 7574 states and 14146 transitions. [2022-07-12 05:46:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 05:46:36,954 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) Word has length 124 [2022-07-12 05:46:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:46:36,981 INFO L225 Difference]: With dead ends: 7574 [2022-07-12 05:46:36,981 INFO L226 Difference]: Without dead ends: 5116 [2022-07-12 05:46:37,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=418, Invalid=1838, Unknown=0, NotChecked=0, Total=2256 [2022-07-12 05:46:37,005 INFO L413 NwaCegarLoop]: 2230 mSDtfsCounter, 6739 mSDsluCounter, 9055 mSDsCounter, 0 mSdLazyCounter, 20672 mSolverCounterSat, 3664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6745 SdHoareTripleChecker+Valid, 11285 SdHoareTripleChecker+Invalid, 24336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3664 IncrementalHoareTripleChecker+Valid, 20672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-07-12 05:46:37,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6745 Valid, 11285 Invalid, 24336 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3664 Valid, 20672 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2022-07-12 05:46:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5116 states. [2022-07-12 05:46:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5116 to 2836. [2022-07-12 05:46:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2836 states, 2073 states have (on average 1.6145682585624699) internal successors, (3347), 2183 states have internal predecessors, (3347), 635 states have call successors, (635), 92 states have call predecessors, (635), 127 states have return successors, (980), 647 states have call predecessors, (980), 630 states have call successors, (980) [2022-07-12 05:46:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 4962 transitions. [2022-07-12 05:46:38,059 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 4962 transitions. Word has length 124 [2022-07-12 05:46:38,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:46:38,059 INFO L495 AbstractCegarLoop]: Abstraction has 2836 states and 4962 transitions. [2022-07-12 05:46:38,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 10 states have internal predecessors, (85), 5 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-12 05:46:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 4962 transitions. [2022-07-12 05:46:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 05:46:38,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:46:38,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:46:38,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 05:46:38,067 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:46:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:46:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1283387646, now seen corresponding path program 1 times [2022-07-12 05:46:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:46:38,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434524534] [2022-07-12 05:46:38,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:46:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:46:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:46:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:46:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:46:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 05:46:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 05:46:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:46:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 05:46:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 05:46:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:46:38,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434524534] [2022-07-12 05:46:38,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434524534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:46:38,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:46:38,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:46:38,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724041309] [2022-07-12 05:46:38,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:46:38,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:46:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:46:38,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:46:38,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:46:38,391 INFO L87 Difference]: Start difference. First operand 2836 states and 4962 transitions. Second operand has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 6 states have internal predecessors, (86), 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) [2022-07-12 05:46:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:46:44,236 INFO L93 Difference]: Finished difference Result 5314 states and 9467 transitions. [2022-07-12 05:46:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 05:46:44,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 6 states have internal predecessors, (86), 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 123 [2022-07-12 05:46:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:46:44,258 INFO L225 Difference]: With dead ends: 5314 [2022-07-12 05:46:44,258 INFO L226 Difference]: Without dead ends: 3883 [2022-07-12 05:46:44,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-12 05:46:44,266 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1384 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 4523 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 3898 SdHoareTripleChecker+Invalid, 4935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 4523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 05:46:44,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 3898 Invalid, 4935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 4523 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 05:46:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2022-07-12 05:46:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 2842. [2022-07-12 05:46:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2842 states, 2079 states have (on average 1.612794612794613) internal successors, (3353), 2189 states have internal predecessors, (3353), 635 states have call successors, (635), 92 states have call predecessors, (635), 127 states have return successors, (980), 647 states have call predecessors, (980), 630 states have call successors, (980) [2022-07-12 05:46:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 4968 transitions. [2022-07-12 05:46:45,210 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 4968 transitions. Word has length 123 [2022-07-12 05:46:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:46:45,210 INFO L495 AbstractCegarLoop]: Abstraction has 2842 states and 4968 transitions. [2022-07-12 05:46:45,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 6 states have internal predecessors, (86), 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) [2022-07-12 05:46:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 4968 transitions. [2022-07-12 05:46:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 05:46:45,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:46:45,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:46:45,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 05:46:45,216 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:46:45,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:46:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1733503299, now seen corresponding path program 1 times [2022-07-12 05:46:45,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:46:45,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62771600] [2022-07-12 05:46:45,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:46:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:46:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:46:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:46:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 05:46:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 05:46:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 05:46:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 05:46:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 05:46:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 05:46:45,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:46:45,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62771600] [2022-07-12 05:46:45,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62771600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:46:45,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:46:45,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:46:45,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852653750] [2022-07-12 05:46:45,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:46:45,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:46:45,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:46:45,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:46:45,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:46:45,545 INFO L87 Difference]: Start difference. First operand 2842 states and 4968 transitions. Second operand has 10 states, 9 states have (on average 10.0) internal successors, (90), 6 states have internal predecessors, (90), 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) [2022-07-12 05:46:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:46:50,726 INFO L93 Difference]: Finished difference Result 4087 states and 7234 transitions. [2022-07-12 05:46:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:46:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.0) internal successors, (90), 6 states have internal predecessors, (90), 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 127 [2022-07-12 05:46:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:46:50,738 INFO L225 Difference]: With dead ends: 4087 [2022-07-12 05:46:50,739 INFO L226 Difference]: Without dead ends: 1259 [2022-07-12 05:46:50,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 05:46:50,751 INFO L413 NwaCegarLoop]: 904 mSDtfsCounter, 1838 mSDsluCounter, 2662 mSDsCounter, 0 mSdLazyCounter, 4374 mSolverCounterSat, 580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 4954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 580 IncrementalHoareTripleChecker+Valid, 4374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:46:50,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 3566 Invalid, 4954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [580 Valid, 4374 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 05:46:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-07-12 05:46:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 538. [2022-07-12 05:46:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 417 states have (on average 1.6235011990407673) internal successors, (677), 438 states have internal predecessors, (677), 93 states have call successors, (93), 26 states have call predecessors, (93), 27 states have return successors, (99), 86 states have call predecessors, (99), 88 states have call successors, (99) [2022-07-12 05:46:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 869 transitions. [2022-07-12 05:46:50,912 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 869 transitions. Word has length 127 [2022-07-12 05:46:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:46:50,912 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 869 transitions. [2022-07-12 05:46:50,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.0) internal successors, (90), 6 states have internal predecessors, (90), 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) [2022-07-12 05:46:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 869 transitions. [2022-07-12 05:46:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 05:46:50,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:46:50,914 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:46:50,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 05:46:50,914 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:46:50,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:46:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash 215493586, now seen corresponding path program 1 times [2022-07-12 05:46:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:46:50,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402872601] [2022-07-12 05:46:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:46:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:46:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:46:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:46:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:46:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 05:46:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 05:46:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 05:46:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 05:46:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 05:46:51,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:46:51,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402872601] [2022-07-12 05:46:51,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402872601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:46:51,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:46:51,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:46:51,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876175514] [2022-07-12 05:46:51,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:46:51,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:46:51,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:46:51,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:46:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:46:51,271 INFO L87 Difference]: Start difference. First operand 538 states and 869 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:46:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:46:57,512 INFO L93 Difference]: Finished difference Result 1498 states and 2543 transitions. [2022-07-12 05:46:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 05:46:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 128 [2022-07-12 05:46:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:46:57,518 INFO L225 Difference]: With dead ends: 1498 [2022-07-12 05:46:57,518 INFO L226 Difference]: Without dead ends: 1005 [2022-07-12 05:46:57,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-07-12 05:46:57,520 INFO L413 NwaCegarLoop]: 897 mSDtfsCounter, 2985 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 4063 mSolverCounterSat, 1543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2996 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 5606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1543 IncrementalHoareTripleChecker+Valid, 4063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 05:46:57,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2996 Valid, 3124 Invalid, 5606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1543 Valid, 4063 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 05:46:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2022-07-12 05:46:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 543. [2022-07-12 05:46:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 421 states have (on average 1.6175771971496438) internal successors, (681), 442 states have internal predecessors, (681), 93 states have call successors, (93), 26 states have call predecessors, (93), 28 states have return successors, (100), 87 states have call predecessors, (100), 88 states have call successors, (100) [2022-07-12 05:46:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 874 transitions. [2022-07-12 05:46:57,706 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 874 transitions. Word has length 128 [2022-07-12 05:46:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:46:57,706 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 874 transitions. [2022-07-12 05:46:57,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:46:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 874 transitions. [2022-07-12 05:46:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 05:46:57,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:46:57,709 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:46:57,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 05:46:57,709 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:46:57,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:46:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash -665721627, now seen corresponding path program 1 times [2022-07-12 05:46:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:46:57,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109608084] [2022-07-12 05:46:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:46:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:46:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:46:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:46:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:46:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 05:46:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:57,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 05:46:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:46:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:58,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 05:46:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:58,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 05:46:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:46:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 05:46:58,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:46:58,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109608084] [2022-07-12 05:46:58,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109608084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:46:58,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:46:58,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 05:46:58,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874235260] [2022-07-12 05:46:58,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:46:58,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 05:46:58,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:46:58,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 05:46:58,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:46:58,043 INFO L87 Difference]: Start difference. First operand 543 states and 874 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:47:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:47:03,529 INFO L93 Difference]: Finished difference Result 1340 states and 2234 transitions. [2022-07-12 05:47:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 05:47:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 131 [2022-07-12 05:47:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:47:03,535 INFO L225 Difference]: With dead ends: 1340 [2022-07-12 05:47:03,535 INFO L226 Difference]: Without dead ends: 842 [2022-07-12 05:47:03,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-12 05:47:03,538 INFO L413 NwaCegarLoop]: 938 mSDtfsCounter, 2114 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 3402 SdHoareTripleChecker+Invalid, 4543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 05:47:03,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 3402 Invalid, 4543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 05:47:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-12 05:47:03,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 548. [2022-07-12 05:47:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 425 states have (on average 1.611764705882353) internal successors, (685), 446 states have internal predecessors, (685), 93 states have call successors, (93), 26 states have call predecessors, (93), 29 states have return successors, (102), 88 states have call predecessors, (102), 88 states have call successors, (102) [2022-07-12 05:47:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 880 transitions. [2022-07-12 05:47:03,711 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 880 transitions. Word has length 131 [2022-07-12 05:47:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:47:03,711 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 880 transitions. [2022-07-12 05:47:03,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 05:47:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 880 transitions. [2022-07-12 05:47:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 05:47:03,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:47:03,714 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:47:03,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 05:47:03,714 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:47:03,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:47:03,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2144603058, now seen corresponding path program 1 times [2022-07-12 05:47:03,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:47:03,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425915831] [2022-07-12 05:47:03,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:47:03,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:47:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:47:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:47:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:47:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:03,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 05:47:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:04,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:04,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 05:47:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:04,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:04,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 05:47:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 05:47:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 05:47:04,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:47:04,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425915831] [2022-07-12 05:47:04,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425915831] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 05:47:04,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990815301] [2022-07-12 05:47:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:47:04,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:47:04,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 05:47:04,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 05:47:04,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 05:47:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:04,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 05:47:04,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 05:47:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 05:47:04,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 05:47:04,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990815301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:47:04,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 05:47:04,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2022-07-12 05:47:04,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215044736] [2022-07-12 05:47:04,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:47:04,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 05:47:04,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:47:04,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 05:47:04,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:47:04,344 INFO L87 Difference]: Start difference. First operand 548 states and 880 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:47:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:47:04,721 INFO L93 Difference]: Finished difference Result 1512 states and 2486 transitions. [2022-07-12 05:47:04,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 05:47:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2022-07-12 05:47:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:47:04,725 INFO L225 Difference]: With dead ends: 1512 [2022-07-12 05:47:04,725 INFO L226 Difference]: Without dead ends: 1009 [2022-07-12 05:47:04,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 05:47:04,727 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 761 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 05:47:04,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1695 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 05:47:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2022-07-12 05:47:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 994. [2022-07-12 05:47:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 770 states have (on average 1.6077922077922078) internal successors, (1238), 807 states have internal predecessors, (1238), 169 states have call successors, (169), 47 states have call predecessors, (169), 54 states have return successors, (200), 165 states have call predecessors, (200), 164 states have call successors, (200) [2022-07-12 05:47:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1607 transitions. [2022-07-12 05:47:04,980 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1607 transitions. Word has length 135 [2022-07-12 05:47:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:47:04,981 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1607 transitions. [2022-07-12 05:47:04,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 05:47:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1607 transitions. [2022-07-12 05:47:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 05:47:04,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:47:04,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:47:05,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 05:47:05,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 05:47:05,184 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:47:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:47:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1416848048, now seen corresponding path program 1 times [2022-07-12 05:47:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:47:05,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695164100] [2022-07-12 05:47:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:47:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:47:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:47:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:47:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:47:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 05:47:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 05:47:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 05:47:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 05:47:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 05:47:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 05:47:05,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:47:05,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695164100] [2022-07-12 05:47:05,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695164100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:47:05,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:47:05,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 05:47:05,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127206578] [2022-07-12 05:47:05,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:47:05,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 05:47:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:47:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 05:47:05,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 05:47:05,483 INFO L87 Difference]: Start difference. First operand 994 states and 1607 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 05:47:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 05:47:13,256 INFO L93 Difference]: Finished difference Result 3517 states and 5971 transitions. [2022-07-12 05:47:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 05:47:13,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 140 [2022-07-12 05:47:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 05:47:13,269 INFO L225 Difference]: With dead ends: 3517 [2022-07-12 05:47:13,269 INFO L226 Difference]: Without dead ends: 2568 [2022-07-12 05:47:13,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-07-12 05:47:13,275 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 3775 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 1524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3784 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 3532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1524 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 05:47:13,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3784 Valid, 1607 Invalid, 3532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1524 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-12 05:47:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-07-12 05:47:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 1940. [2022-07-12 05:47:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1498 states have (on average 1.6114819759679573) internal successors, (2414), 1566 states have internal predecessors, (2414), 336 states have call successors, (336), 89 states have call predecessors, (336), 105 states have return successors, (422), 332 states have call predecessors, (422), 331 states have call successors, (422) [2022-07-12 05:47:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 3172 transitions. [2022-07-12 05:47:13,968 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 3172 transitions. Word has length 140 [2022-07-12 05:47:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 05:47:13,968 INFO L495 AbstractCegarLoop]: Abstraction has 1940 states and 3172 transitions. [2022-07-12 05:47:13,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-12 05:47:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 3172 transitions. [2022-07-12 05:47:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-12 05:47:13,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 05:47:13,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 05:47:13,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 05:47:13,972 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 05:47:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 05:47:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1124082142, now seen corresponding path program 1 times [2022-07-12 05:47:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 05:47:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485686207] [2022-07-12 05:47:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 05:47:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 05:47:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 05:47:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 05:47:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 05:47:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 05:47:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 05:47:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 05:47:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 05:47:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 05:47:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 05:47:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 05:47:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 05:47:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 05:47:14,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485686207] [2022-07-12 05:47:14,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485686207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 05:47:14,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 05:47:14,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 05:47:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474038660] [2022-07-12 05:47:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 05:47:14,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 05:47:14,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 05:47:14,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 05:47:14,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 05:47:14,357 INFO L87 Difference]: Start difference. First operand 1940 states and 3172 transitions. Second operand has 11 states, 10 states have (on average 10.1) internal successors, (101), 7 states have internal predecessors, (101), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14)