./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:40:15,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:40:15,092 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:40:15,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:40:15,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:40:15,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:40:15,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:40:15,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:40:15,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:40:15,127 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:40:15,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:40:15,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:40:15,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:40:15,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:40:15,130 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:40:15,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:40:15,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:40:15,131 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:40:15,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:40:15,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:40:15,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:40:15,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:40:15,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:40:15,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:40:15,135 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:40:15,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:40:15,136 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:40:15,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:40:15,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:40:15,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:40:15,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:40:15,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:40:15,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:40:15,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:40:15,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:40:15,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:40:15,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:40:15,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:40:15,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:40:15,141 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:40:15,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:40:15,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:40:15,142 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> c39b0b488ad07619ca8d4ed9273747459006984c072c0894ad54004ae965569d [2023-11-28 20:40:15,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:40:15,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:40:15,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:40:15,406 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:40:15,406 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:40:15,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2023-11-28 20:40:18,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:40:18,496 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:40:18,496 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c [2023-11-28 20:40:18,516 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/data/da58f9c34/ff56cb4ba2e9465b8a1ec22e5b5630e1/FLAG6d4813387 [2023-11-28 20:40:18,529 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/data/da58f9c34/ff56cb4ba2e9465b8a1ec22e5b5630e1 [2023-11-28 20:40:18,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:40:18,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:40:18,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:40:18,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:40:18,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:40:18,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:40:18" (1/1) ... [2023-11-28 20:40:18,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280eb714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:18, skipping insertion in model container [2023-11-28 20:40:18,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:40:18" (1/1) ... [2023-11-28 20:40:18,621 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:40:19,070 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c[70298,70311] [2023-11-28 20:40:19,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:40:19,093 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:40:19,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2023-11-28 20:40:19,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [412] [2023-11-28 20:40:19,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1940] [2023-11-28 20:40:19,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2058] [2023-11-28 20:40:19,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2070] [2023-11-28 20:40:19,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2436] [2023-11-28 20:40:19,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2471] [2023-11-28 20:40:19,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3132] [2023-11-28 20:40:19,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3314] [2023-11-28 20:40:19,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3323] [2023-11-28 20:40:19,187 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/sv-benchmarks/c/product-lines/elevator_spec2_product26.cil.c[70298,70311] [2023-11-28 20:40:19,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:40:19,219 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:40:19,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19 WrapperNode [2023-11-28 20:40:19,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:40:19,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:40:19,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:40:19,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:40:19,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,303 INFO L138 Inliner]: procedures = 93, calls = 340, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 860 [2023-11-28 20:40:19,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:40:19,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:40:19,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:40:19,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:40:19,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,351 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2023-11-28 20:40:19,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:40:19,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:40:19,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:40:19,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:40:19,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (1/1) ... [2023-11-28 20:40:19,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:40:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:40:19,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:40:19,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e770718-f6ab-43fb-8b5e-5dd1601f44e4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:40:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:40:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2023-11-28 20:40:19,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2023-11-28 20:40:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2023-11-28 20:40:19,486 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2023-11-28 20:40:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2023-11-28 20:40:19,486 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2023-11-28 20:40:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2023-11-28 20:40:19,486 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2023-11-28 20:40:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2023-11-28 20:40:19,486 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2023-11-28 20:40:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2023-11-28 20:40:19,487 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2023-11-28 20:40:19,487 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2023-11-28 20:40:19,487 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2023-11-28 20:40:19,487 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2023-11-28 20:40:19,487 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2023-11-28 20:40:19,487 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2023-11-28 20:40:19,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2023-11-28 20:40:19,488 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2023-11-28 20:40:19,488 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2023-11-28 20:40:19,488 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2023-11-28 20:40:19,488 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2023-11-28 20:40:19,488 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2023-11-28 20:40:19,488 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2023-11-28 20:40:19,488 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2023-11-28 20:40:19,488 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2023-11-28 20:40:19,488 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2023-11-28 20:40:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2023-11-28 20:40:19,489 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2023-11-28 20:40:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2023-11-28 20:40:19,489 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2023-11-28 20:40:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2023-11-28 20:40:19,489 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2023-11-28 20:40:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2023-11-28 20:40:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2023-11-28 20:40:19,490 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2023-11-28 20:40:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:40:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:40:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:40:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 20:40:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-28 20:40:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-28 20:40:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-28 20:40:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-28 20:40:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-28 20:40:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-28 20:40:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-28 20:40:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-28 20:40:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-28 20:40:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-28 20:40:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-28 20:40:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-11-28 20:40:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-11-28 20:40:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2023-11-28 20:40:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2023-11-28 20:40:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2023-11-28 20:40:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2023-11-28 20:40:19,492 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2023-11-28 20:40:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2023-11-28 20:40:19,492 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2023-11-28 20:40:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2023-11-28 20:40:19,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2023-11-28 20:40:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:40:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:40:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2023-11-28 20:40:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2023-11-28 20:40:19,682 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:40:19,698 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:40:20,618 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:40:20,724 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:40:20,724 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:40:20,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:40:20 BoogieIcfgContainer [2023-11-28 20:40:20,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:40:20,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:40:20,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:40:20,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:40:20,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:40:18" (1/3) ... [2023-11-28 20:40:20,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7205346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:40:20, skipping insertion in model container [2023-11-28 20:40:20,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:40:19" (2/3) ... [2023-11-28 20:40:20,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7205346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:40:20, skipping insertion in model container [2023-11-28 20:40:20,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:40:20" (3/3) ... [2023-11-28 20:40:20,734 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2023-11-28 20:40:20,753 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:40:20,753 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:40:20,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:40:20,819 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=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dacaf44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:40:20,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:40:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 414 states have (on average 1.7439613526570048) internal successors, (722), 437 states have internal predecessors, (722), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) [2023-11-28 20:40:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-28 20:40:20,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:20,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:40:20,842 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:20,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1949591273, now seen corresponding path program 1 times [2023-11-28 20:40:20,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:20,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50657842] [2023-11-28 20:40:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:20,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:21,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:40:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-28 20:40:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:40:22,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:22,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50657842] [2023-11-28 20:40:22,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50657842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:22,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:22,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:40:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373818896] [2023-11-28 20:40:22,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:22,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:40:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:22,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:40:22,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:40:22,141 INFO L87 Difference]: Start difference. First operand has 529 states, 414 states have (on average 1.7439613526570048) internal successors, (722), 437 states have internal predecessors, (722), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:28,381 INFO L93 Difference]: Finished difference Result 1201 states and 2076 transitions. [2023-11-28 20:40:28,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:40:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2023-11-28 20:40:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:28,402 INFO L225 Difference]: With dead ends: 1201 [2023-11-28 20:40:28,402 INFO L226 Difference]: Without dead ends: 681 [2023-11-28 20:40:28,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:40:28,414 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 676 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 2832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:28,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1067 Invalid, 2832 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [119 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-11-28 20:40:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-28 20:40:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2023-11-28 20:40:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.733009708737864) internal successors, (714), 433 states have internal predecessors, (714), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-28 20:40:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 891 transitions. [2023-11-28 20:40:28,642 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 891 transitions. Word has length 46 [2023-11-28 20:40:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:28,643 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 891 transitions. [2023-11-28 20:40:28,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 891 transitions. [2023-11-28 20:40:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-28 20:40:28,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:28,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:40:28,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:40:28,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:28,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash 51341049, now seen corresponding path program 1 times [2023-11-28 20:40:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473989136] [2023-11-28 20:40:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:28,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:28,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 20:40:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-28 20:40:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:40:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473989136] [2023-11-28 20:40:29,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473989136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:29,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:40:29,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854432292] [2023-11-28 20:40:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:29,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:40:29,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:40:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:40:29,364 INFO L87 Difference]: Start difference. First operand 525 states and 891 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:34,614 INFO L93 Difference]: Finished difference Result 1194 states and 2049 transitions. [2023-11-28 20:40:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:40:34,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2023-11-28 20:40:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:34,622 INFO L225 Difference]: With dead ends: 1194 [2023-11-28 20:40:34,622 INFO L226 Difference]: Without dead ends: 681 [2023-11-28 20:40:34,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:40:34,627 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 1098 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:34,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1056 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-28 20:40:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-28 20:40:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2023-11-28 20:40:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7305825242718447) internal successors, (713), 433 states have internal predecessors, (713), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-28 20:40:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 890 transitions. [2023-11-28 20:40:34,724 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 890 transitions. Word has length 48 [2023-11-28 20:40:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:34,724 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 890 transitions. [2023-11-28 20:40:34,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 890 transitions. [2023-11-28 20:40:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-28 20:40:34,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:34,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:40:34,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:40:34,728 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:34,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1225420843, now seen corresponding path program 1 times [2023-11-28 20:40:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074474178] [2023-11-28 20:40:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:35,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-28 20:40:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-28 20:40:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:40:35,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:35,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074474178] [2023-11-28 20:40:35,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074474178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:35,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:35,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:40:35,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927561486] [2023-11-28 20:40:35,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:35,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:40:35,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:35,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:40:35,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:40:35,410 INFO L87 Difference]: Start difference. First operand 525 states and 890 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:40,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:40,643 INFO L93 Difference]: Finished difference Result 1194 states and 2048 transitions. [2023-11-28 20:40:40,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:40:40,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2023-11-28 20:40:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:40,648 INFO L225 Difference]: With dead ends: 1194 [2023-11-28 20:40:40,648 INFO L226 Difference]: Without dead ends: 681 [2023-11-28 20:40:40,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:40:40,652 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 671 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 2805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:40,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1052 Invalid, 2805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-28 20:40:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-28 20:40:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2023-11-28 20:40:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7281553398058251) internal successors, (712), 433 states have internal predecessors, (712), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-28 20:40:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 889 transitions. [2023-11-28 20:40:40,729 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 889 transitions. Word has length 49 [2023-11-28 20:40:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:40,730 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 889 transitions. [2023-11-28 20:40:40,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 889 transitions. [2023-11-28 20:40:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-28 20:40:40,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:40,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:40:40,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:40:40,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:40,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:40,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1303040387, now seen corresponding path program 1 times [2023-11-28 20:40:40,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:40,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589825750] [2023-11-28 20:40:40,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:40,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:41,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:41,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-28 20:40:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-28 20:40:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:40:41,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:41,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589825750] [2023-11-28 20:40:41,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589825750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:41,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:41,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:40:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023937471] [2023-11-28 20:40:41,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:41,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:40:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:41,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:40:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:40:41,379 INFO L87 Difference]: Start difference. First operand 525 states and 889 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:46,541 INFO L93 Difference]: Finished difference Result 1194 states and 2047 transitions. [2023-11-28 20:40:46,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:40:46,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2023-11-28 20:40:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:46,546 INFO L225 Difference]: With dead ends: 1194 [2023-11-28 20:40:46,546 INFO L226 Difference]: Without dead ends: 681 [2023-11-28 20:40:46,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:40:46,549 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 667 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:46,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1049 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-28 20:40:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-28 20:40:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2023-11-28 20:40:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7257281553398058) internal successors, (711), 433 states have internal predecessors, (711), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-28 20:40:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 888 transitions. [2023-11-28 20:40:46,645 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 888 transitions. Word has length 50 [2023-11-28 20:40:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:46,645 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 888 transitions. [2023-11-28 20:40:46,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 888 transitions. [2023-11-28 20:40:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-28 20:40:46,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:46,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:40:46,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:40:46,647 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:46,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1433014489, now seen corresponding path program 1 times [2023-11-28 20:40:46,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:46,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763545772] [2023-11-28 20:40:46,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:46,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:46,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-28 20:40:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:40:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:40:47,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763545772] [2023-11-28 20:40:47,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763545772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:47,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:47,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:40:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917905659] [2023-11-28 20:40:47,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:47,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:40:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:47,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:40:47,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:40:47,325 INFO L87 Difference]: Start difference. First operand 525 states and 888 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:52,359 INFO L93 Difference]: Finished difference Result 1194 states and 2046 transitions. [2023-11-28 20:40:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:40:52,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2023-11-28 20:40:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:52,364 INFO L225 Difference]: With dead ends: 1194 [2023-11-28 20:40:52,364 INFO L226 Difference]: Without dead ends: 681 [2023-11-28 20:40:52,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:40:52,367 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 665 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:52,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1064 Invalid, 2805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-28 20:40:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-28 20:40:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 525. [2023-11-28 20:40:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.7233009708737863) internal successors, (710), 433 states have internal predecessors, (710), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-28 20:40:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 887 transitions. [2023-11-28 20:40:52,435 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 887 transitions. Word has length 51 [2023-11-28 20:40:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:52,436 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 887 transitions. [2023-11-28 20:40:52,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:40:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 887 transitions. [2023-11-28 20:40:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-28 20:40:52,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:52,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:40:52,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:40:52,439 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:52,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1198663169, now seen corresponding path program 1 times [2023-11-28 20:40:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:52,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470020291] [2023-11-28 20:40:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:52,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:52,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:52,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:52,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:40:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:40:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:53,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:53,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:40:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:40:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470020291] [2023-11-28 20:40:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470020291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:40:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:40:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:40:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685826775] [2023-11-28 20:40:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:40:53,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:40:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:40:53,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:40:53,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:40:53,073 INFO L87 Difference]: Start difference. First operand 525 states and 887 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:40:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:59,466 INFO L93 Difference]: Finished difference Result 1170 states and 1995 transitions. [2023-11-28 20:40:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:40:59,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 52 [2023-11-28 20:40:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:59,472 INFO L225 Difference]: With dead ends: 1170 [2023-11-28 20:40:59,472 INFO L226 Difference]: Without dead ends: 705 [2023-11-28 20:40:59,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-28 20:40:59,476 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 1196 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 4706 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 4962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 4706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:59,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1901 Invalid, 4962 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [256 Valid, 4706 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-11-28 20:40:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-11-28 20:40:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 537. [2023-11-28 20:40:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.7197149643705463) internal successors, (724), 444 states have internal predecessors, (724), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2023-11-28 20:40:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 905 transitions. [2023-11-28 20:40:59,550 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 905 transitions. Word has length 52 [2023-11-28 20:40:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:59,551 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 905 transitions. [2023-11-28 20:40:59,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:40:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 905 transitions. [2023-11-28 20:40:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-28 20:40:59,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:59,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:40:59,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:40:59,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:40:59,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash -736997118, now seen corresponding path program 1 times [2023-11-28 20:40:59,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:40:59,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75920733] [2023-11-28 20:40:59,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:59,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:40:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:40:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:40:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:40:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:00,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:41:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:00,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:00,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75920733] [2023-11-28 20:41:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75920733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:41:00,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962718542] [2023-11-28 20:41:00,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:00,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:41:00,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:41:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:41:00,165 INFO L87 Difference]: Start difference. First operand 537 states and 905 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:05,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:05,061 INFO L93 Difference]: Finished difference Result 1182 states and 2016 transitions. [2023-11-28 20:41:05,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:41:05,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2023-11-28 20:41:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:05,066 INFO L225 Difference]: With dead ends: 1182 [2023-11-28 20:41:05,066 INFO L226 Difference]: Without dead ends: 701 [2023-11-28 20:41:05,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:41:05,068 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 758 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 2615 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:05,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1040 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2615 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-28 20:41:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-11-28 20:41:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 537. [2023-11-28 20:41:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.7078384798099762) internal successors, (719), 444 states have internal predecessors, (719), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2023-11-28 20:41:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 900 transitions. [2023-11-28 20:41:05,138 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 900 transitions. Word has length 52 [2023-11-28 20:41:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:05,139 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 900 transitions. [2023-11-28 20:41:05,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 900 transitions. [2023-11-28 20:41:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-28 20:41:05,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:05,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:05,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:41:05,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:05,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:05,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2062125155, now seen corresponding path program 1 times [2023-11-28 20:41:05,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:05,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935210587] [2023-11-28 20:41:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:05,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:41:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:05,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:41:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:05,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:05,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935210587] [2023-11-28 20:41:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935210587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:05,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:05,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:41:05,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553602135] [2023-11-28 20:41:05,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:05,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:41:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:05,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:41:05,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:41:05,747 INFO L87 Difference]: Start difference. First operand 537 states and 900 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:10,387 INFO L93 Difference]: Finished difference Result 1182 states and 2011 transitions. [2023-11-28 20:41:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:41:10,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2023-11-28 20:41:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:10,393 INFO L225 Difference]: With dead ends: 1182 [2023-11-28 20:41:10,393 INFO L226 Difference]: Without dead ends: 701 [2023-11-28 20:41:10,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:41:10,396 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 752 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:10,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1025 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-28 20:41:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-11-28 20:41:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 537. [2023-11-28 20:41:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.6959619952494063) internal successors, (714), 444 states have internal predecessors, (714), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2023-11-28 20:41:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 895 transitions. [2023-11-28 20:41:10,504 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 895 transitions. Word has length 53 [2023-11-28 20:41:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:10,505 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 895 transitions. [2023-11-28 20:41:10,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 895 transitions. [2023-11-28 20:41:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-28 20:41:10,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:10,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:10,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:41:10,507 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:10,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash -526904899, now seen corresponding path program 1 times [2023-11-28 20:41:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:10,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263933775] [2023-11-28 20:41:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:10,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:41:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-28 20:41:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:11,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:11,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:11,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263933775] [2023-11-28 20:41:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263933775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:41:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692655766] [2023-11-28 20:41:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:11,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:41:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:41:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:41:11,088 INFO L87 Difference]: Start difference. First operand 537 states and 895 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:15,824 INFO L93 Difference]: Finished difference Result 1182 states and 2006 transitions. [2023-11-28 20:41:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:41:15,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2023-11-28 20:41:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:15,830 INFO L225 Difference]: With dead ends: 1182 [2023-11-28 20:41:15,830 INFO L226 Difference]: Without dead ends: 701 [2023-11-28 20:41:15,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:41:15,833 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 757 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:15,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1050 Invalid, 2695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-28 20:41:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-11-28 20:41:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 537. [2023-11-28 20:41:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.6840855106888362) internal successors, (709), 444 states have internal predecessors, (709), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2023-11-28 20:41:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 890 transitions. [2023-11-28 20:41:15,941 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 890 transitions. Word has length 54 [2023-11-28 20:41:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:15,941 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 890 transitions. [2023-11-28 20:41:15,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 890 transitions. [2023-11-28 20:41:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-28 20:41:15,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:15,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:15,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:41:15,943 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:15,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash -840479970, now seen corresponding path program 1 times [2023-11-28 20:41:15,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253688570] [2023-11-28 20:41:15,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:15,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:16,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:16,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:41:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:41:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:16,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:16,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:16,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253688570] [2023-11-28 20:41:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253688570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:16,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:16,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:41:16,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043202875] [2023-11-28 20:41:16,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:16,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:41:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:16,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:41:16,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:41:16,606 INFO L87 Difference]: Start difference. First operand 537 states and 890 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:41:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:23,069 INFO L93 Difference]: Finished difference Result 1173 states and 1982 transitions. [2023-11-28 20:41:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:41:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 55 [2023-11-28 20:41:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:23,074 INFO L225 Difference]: With dead ends: 1173 [2023-11-28 20:41:23,074 INFO L226 Difference]: Without dead ends: 706 [2023-11-28 20:41:23,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:41:23,076 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 1179 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 4580 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 4843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 4580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:23,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 1837 Invalid, 4843 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [263 Valid, 4580 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-11-28 20:41:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2023-11-28 20:41:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 537. [2023-11-28 20:41:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.6817102137767221) internal successors, (708), 444 states have internal predecessors, (708), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2023-11-28 20:41:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 889 transitions. [2023-11-28 20:41:23,166 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 889 transitions. Word has length 55 [2023-11-28 20:41:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:23,166 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 889 transitions. [2023-11-28 20:41:23,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:41:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 889 transitions. [2023-11-28 20:41:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-28 20:41:23,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:23,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:23,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:41:23,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:23,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1650034750, now seen corresponding path program 1 times [2023-11-28 20:41:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438410075] [2023-11-28 20:41:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:41:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:23,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:41:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:23,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438410075] [2023-11-28 20:41:23,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438410075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:23,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:23,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:41:23,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368073457] [2023-11-28 20:41:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:23,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:41:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:23,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:41:23,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:41:23,665 INFO L87 Difference]: Start difference. First operand 537 states and 889 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:28,484 INFO L93 Difference]: Finished difference Result 1182 states and 1998 transitions. [2023-11-28 20:41:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:41:28,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2023-11-28 20:41:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:28,489 INFO L225 Difference]: With dead ends: 1182 [2023-11-28 20:41:28,489 INFO L226 Difference]: Without dead ends: 701 [2023-11-28 20:41:28,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:41:28,491 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 750 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:28,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1027 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-28 20:41:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-11-28 20:41:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 537. [2023-11-28 20:41:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 421 states have (on average 1.669833729216152) internal successors, (703), 444 states have internal predecessors, (703), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2023-11-28 20:41:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 884 transitions. [2023-11-28 20:41:28,572 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 884 transitions. Word has length 55 [2023-11-28 20:41:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:28,572 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 884 transitions. [2023-11-28 20:41:28,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 884 transitions. [2023-11-28 20:41:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-28 20:41:28,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:28,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:28,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:41:28,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:28,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash -530432422, now seen corresponding path program 1 times [2023-11-28 20:41:28,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764318871] [2023-11-28 20:41:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:28,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:41:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:41:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:29,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:29,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:29,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:29,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764318871] [2023-11-28 20:41:29,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764318871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:29,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:29,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:41:29,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265132867] [2023-11-28 20:41:29,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:29,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:41:29,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:29,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:41:29,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:41:29,270 INFO L87 Difference]: Start difference. First operand 537 states and 884 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:41:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:35,992 INFO L93 Difference]: Finished difference Result 1191 states and 2003 transitions. [2023-11-28 20:41:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:41:35,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2023-11-28 20:41:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:35,996 INFO L225 Difference]: With dead ends: 1191 [2023-11-28 20:41:35,996 INFO L226 Difference]: Without dead ends: 722 [2023-11-28 20:41:35,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:41:35,998 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 1173 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 4562 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 4823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 4562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:35,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1866 Invalid, 4823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [261 Valid, 4562 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-11-28 20:41:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2023-11-28 20:41:36,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 540. [2023-11-28 20:41:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 424 states have (on average 1.6627358490566038) internal successors, (705), 447 states have internal predecessors, (705), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2023-11-28 20:41:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 886 transitions. [2023-11-28 20:41:36,068 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 886 transitions. Word has length 56 [2023-11-28 20:41:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:36,068 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 886 transitions. [2023-11-28 20:41:36,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:41:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 886 transitions. [2023-11-28 20:41:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-28 20:41:36,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:36,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:41:36,070 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:36,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1248179832, now seen corresponding path program 1 times [2023-11-28 20:41:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:36,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418439067] [2023-11-28 20:41:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:41:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:41:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:36,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:36,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418439067] [2023-11-28 20:41:36,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418439067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:36,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:36,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:41:36,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897377709] [2023-11-28 20:41:36,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:36,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:41:36,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:36,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:41:36,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:41:36,602 INFO L87 Difference]: Start difference. First operand 540 states and 886 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:41,076 INFO L93 Difference]: Finished difference Result 1191 states and 1999 transitions. [2023-11-28 20:41:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:41:41,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2023-11-28 20:41:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:41,080 INFO L225 Difference]: With dead ends: 1191 [2023-11-28 20:41:41,080 INFO L226 Difference]: Without dead ends: 707 [2023-11-28 20:41:41,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:41:41,082 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 1167 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:41,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 1019 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-28 20:41:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2023-11-28 20:41:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 540. [2023-11-28 20:41:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 424 states have (on average 1.650943396226415) internal successors, (700), 447 states have internal predecessors, (700), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2023-11-28 20:41:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 881 transitions. [2023-11-28 20:41:41,154 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 881 transitions. Word has length 56 [2023-11-28 20:41:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:41,154 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 881 transitions. [2023-11-28 20:41:41,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 881 transitions. [2023-11-28 20:41:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-28 20:41:41,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:41,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:41,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:41:41,155 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:41,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash -969477639, now seen corresponding path program 1 times [2023-11-28 20:41:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:41,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422210823] [2023-11-28 20:41:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:41,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:41:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-28 20:41:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:41,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422210823] [2023-11-28 20:41:41,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422210823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:41,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:41,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:41:41,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137650314] [2023-11-28 20:41:41,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:41,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:41:41,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:41:41,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:41:41,818 INFO L87 Difference]: Start difference. First operand 540 states and 881 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:41:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:48,406 INFO L93 Difference]: Finished difference Result 1197 states and 2000 transitions. [2023-11-28 20:41:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:41:48,407 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2023-11-28 20:41:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:48,411 INFO L225 Difference]: With dead ends: 1197 [2023-11-28 20:41:48,411 INFO L226 Difference]: Without dead ends: 728 [2023-11-28 20:41:48,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:41:48,413 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 734 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 4667 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 4792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:48,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1871 Invalid, 4792 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [125 Valid, 4667 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-28 20:41:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2023-11-28 20:41:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 544. [2023-11-28 20:41:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 428 states have (on average 1.6425233644859814) internal successors, (703), 451 states have internal predecessors, (703), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2023-11-28 20:41:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 884 transitions. [2023-11-28 20:41:48,486 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 884 transitions. Word has length 57 [2023-11-28 20:41:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:48,486 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 884 transitions. [2023-11-28 20:41:48,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:41:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 884 transitions. [2023-11-28 20:41:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-28 20:41:48,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:48,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:48,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:41:48,488 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:48,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1786895335, now seen corresponding path program 1 times [2023-11-28 20:41:48,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:48,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890010938] [2023-11-28 20:41:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:48,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:48,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:41:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-28 20:41:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:49,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:49,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890010938] [2023-11-28 20:41:49,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890010938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:49,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:49,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:41:49,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64493100] [2023-11-28 20:41:49,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:49,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:41:49,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:49,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:41:49,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:41:49,124 INFO L87 Difference]: Start difference. First operand 544 states and 884 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:54,030 INFO L93 Difference]: Finished difference Result 1239 states and 2044 transitions. [2023-11-28 20:41:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:41:54,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2023-11-28 20:41:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:54,034 INFO L225 Difference]: With dead ends: 1239 [2023-11-28 20:41:54,035 INFO L226 Difference]: Without dead ends: 689 [2023-11-28 20:41:54,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:41:54,037 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1079 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:54,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 1029 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-28 20:41:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2023-11-28 20:41:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 526. [2023-11-28 20:41:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.6513317191283292) internal successors, (682), 434 states have internal predecessors, (682), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-28 20:41:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 859 transitions. [2023-11-28 20:41:54,118 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 859 transitions. Word has length 57 [2023-11-28 20:41:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:54,118 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 859 transitions. [2023-11-28 20:41:54,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:41:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 859 transitions. [2023-11-28 20:41:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-28 20:41:54,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:54,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:54,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:41:54,119 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:41:54,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1139405205, now seen corresponding path program 1 times [2023-11-28 20:41:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:41:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75036661] [2023-11-28 20:41:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:41:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:41:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:41:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:54,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 20:41:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:54,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:41:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:41:54,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:41:54,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75036661] [2023-11-28 20:41:54,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75036661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:41:54,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:41:54,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:41:54,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665095516] [2023-11-28 20:41:54,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:41:54,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:41:54,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:41:54,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:41:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:41:54,665 INFO L87 Difference]: Start difference. First operand 526 states and 859 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:42:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:01,314 INFO L93 Difference]: Finished difference Result 1173 states and 1958 transitions. [2023-11-28 20:42:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:42:01,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2023-11-28 20:42:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:01,319 INFO L225 Difference]: With dead ends: 1173 [2023-11-28 20:42:01,319 INFO L226 Difference]: Without dead ends: 706 [2023-11-28 20:42:01,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:42:01,321 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 1127 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 4455 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 4455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:01,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 1841 Invalid, 4714 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [259 Valid, 4455 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-28 20:42:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2023-11-28 20:42:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 531. [2023-11-28 20:42:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.6435406698564594) internal successors, (687), 439 states have internal predecessors, (687), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-28 20:42:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 864 transitions. [2023-11-28 20:42:01,393 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 864 transitions. Word has length 58 [2023-11-28 20:42:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:01,393 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 864 transitions. [2023-11-28 20:42:01,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:42:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 864 transitions. [2023-11-28 20:42:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-28 20:42:01,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:01,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:42:01,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:42:01,395 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:01,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash 434533446, now seen corresponding path program 1 times [2023-11-28 20:42:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:01,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633263430] [2023-11-28 20:42:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:01,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:01,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:42:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:01,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:01,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:01,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:42:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633263430] [2023-11-28 20:42:01,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633263430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:01,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:01,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:42:01,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16682764] [2023-11-28 20:42:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:01,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:42:01,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:01,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:42:01,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:42:01,986 INFO L87 Difference]: Start difference. First operand 531 states and 864 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:42:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:06,496 INFO L93 Difference]: Finished difference Result 1174 states and 1956 transitions. [2023-11-28 20:42:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:42:06,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2023-11-28 20:42:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:06,502 INFO L225 Difference]: With dead ends: 1174 [2023-11-28 20:42:06,502 INFO L226 Difference]: Without dead ends: 687 [2023-11-28 20:42:06,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:42:06,504 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 1117 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:06,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1033 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-28 20:42:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-11-28 20:42:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 531. [2023-11-28 20:42:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 418 states have (on average 1.6339712918660287) internal successors, (683), 439 states have internal predecessors, (683), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-28 20:42:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 860 transitions. [2023-11-28 20:42:06,621 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 860 transitions. Word has length 59 [2023-11-28 20:42:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:06,622 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 860 transitions. [2023-11-28 20:42:06,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-28 20:42:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 860 transitions. [2023-11-28 20:42:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-28 20:42:06,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:06,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:42:06,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:42:06,624 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:06,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1278538948, now seen corresponding path program 1 times [2023-11-28 20:42:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324043547] [2023-11-28 20:42:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:06,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:06,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:42:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:42:07,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:07,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324043547] [2023-11-28 20:42:07,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324043547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:07,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:07,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:42:07,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831849034] [2023-11-28 20:42:07,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:07,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:42:07,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:07,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:42:07,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:42:07,366 INFO L87 Difference]: Start difference. First operand 531 states and 860 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:42:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:16,495 INFO L93 Difference]: Finished difference Result 1924 states and 3293 transitions. [2023-11-28 20:42:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:42:16,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2023-11-28 20:42:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:16,504 INFO L225 Difference]: With dead ends: 1924 [2023-11-28 20:42:16,505 INFO L226 Difference]: Without dead ends: 1464 [2023-11-28 20:42:16,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:42:16,507 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 2620 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 3808 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 4434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 3808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:16,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2702 Valid, 1512 Invalid, 4434 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [626 Valid, 3808 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-11-28 20:42:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2023-11-28 20:42:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1001. [2023-11-28 20:42:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 789 states have (on average 1.6742712294043092) internal successors, (1321), 819 states have internal predecessors, (1321), 174 states have call successors, (174), 36 states have call predecessors, (174), 37 states have return successors, (176), 158 states have call predecessors, (176), 169 states have call successors, (176) [2023-11-28 20:42:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1671 transitions. [2023-11-28 20:42:16,711 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1671 transitions. Word has length 59 [2023-11-28 20:42:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:16,712 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1671 transitions. [2023-11-28 20:42:16,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-28 20:42:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1671 transitions. [2023-11-28 20:42:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-28 20:42:16,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:16,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:42:16,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:42:16,716 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:16,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:16,717 INFO L85 PathProgramCache]: Analyzing trace with hash -141572211, now seen corresponding path program 1 times [2023-11-28 20:42:16,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:16,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85248079] [2023-11-28 20:42:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:42:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:42:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-28 20:42:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:42:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:42:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:17,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85248079] [2023-11-28 20:42:17,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85248079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:42:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497458697] [2023-11-28 20:42:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:17,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:42:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:42:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:42:17,921 INFO L87 Difference]: Start difference. First operand 1001 states and 1671 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-28 20:42:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:25,026 INFO L93 Difference]: Finished difference Result 2684 states and 4648 transitions. [2023-11-28 20:42:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:42:25,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2023-11-28 20:42:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:25,036 INFO L225 Difference]: With dead ends: 2684 [2023-11-28 20:42:25,036 INFO L226 Difference]: Without dead ends: 1755 [2023-11-28 20:42:25,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:42:25,040 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 2066 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 2946 mSolverCounterSat, 817 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2144 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 3763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 817 IncrementalHoareTripleChecker+Valid, 2946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:25,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2144 Valid, 1577 Invalid, 3763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [817 Valid, 2946 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-11-28 20:42:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2023-11-28 20:42:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1005. [2023-11-28 20:42:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 793 states have (on average 1.6708701134930644) internal successors, (1325), 823 states have internal predecessors, (1325), 174 states have call successors, (174), 36 states have call predecessors, (174), 37 states have return successors, (176), 158 states have call predecessors, (176), 169 states have call successors, (176) [2023-11-28 20:42:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1675 transitions. [2023-11-28 20:42:25,291 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1675 transitions. Word has length 88 [2023-11-28 20:42:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:25,291 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1675 transitions. [2023-11-28 20:42:25,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-28 20:42:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1675 transitions. [2023-11-28 20:42:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-28 20:42:25,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:25,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:42:25,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:42:25,295 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:25,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash -457400812, now seen corresponding path program 1 times [2023-11-28 20:42:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863822518] [2023-11-28 20:42:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:25,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:25,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:25,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:42:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:26,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:26,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-28 20:42:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:26,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-28 20:42:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:42:26,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:26,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863822518] [2023-11-28 20:42:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863822518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-28 20:42:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601511657] [2023-11-28 20:42:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:26,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 20:42:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:26,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 20:42:26,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-28 20:42:26,775 INFO L87 Difference]: Start difference. First operand 1005 states and 1675 transitions. Second operand has 15 states, 12 states have (on average 5.75) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-28 20:42:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:40,278 INFO L93 Difference]: Finished difference Result 3063 states and 5286 transitions. [2023-11-28 20:42:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-28 20:42:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 5.75) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 90 [2023-11-28 20:42:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:40,288 INFO L225 Difference]: With dead ends: 3063 [2023-11-28 20:42:40,288 INFO L226 Difference]: Without dead ends: 2129 [2023-11-28 20:42:40,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2023-11-28 20:42:40,293 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 4208 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 8411 mSolverCounterSat, 1503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4221 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 9914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1503 IncrementalHoareTripleChecker+Valid, 8411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:40,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4221 Valid, 2986 Invalid, 9914 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1503 Valid, 8411 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-11-28 20:42:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2023-11-28 20:42:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1424. [2023-11-28 20:42:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1115 states have (on average 1.6448430493273543) internal successors, (1834), 1147 states have internal predecessors, (1834), 250 states have call successors, (250), 47 states have call predecessors, (250), 58 states have return successors, (281), 240 states have call predecessors, (281), 245 states have call successors, (281) [2023-11-28 20:42:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2365 transitions. [2023-11-28 20:42:40,631 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2365 transitions. Word has length 90 [2023-11-28 20:42:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:40,631 INFO L495 AbstractCegarLoop]: Abstraction has 1424 states and 2365 transitions. [2023-11-28 20:42:40,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 5.75) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-28 20:42:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2365 transitions. [2023-11-28 20:42:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-28 20:42:40,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:40,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:42:40,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 20:42:40,634 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:42:40,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:40,634 INFO L85 PathProgramCache]: Analyzing trace with hash -531764760, now seen corresponding path program 1 times [2023-11-28 20:42:40,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:42:40,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947124023] [2023-11-28 20:42:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:40,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:42:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:40,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:42:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:40,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:40,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:42:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:42:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:41,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:41,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:42:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:41,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:42:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:41,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:42:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:42:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:42:41,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:42:41,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947124023] [2023-11-28 20:42:41,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947124023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:42:41,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:42:41,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:42:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035772142] [2023-11-28 20:42:41,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:42:41,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:42:41,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:42:41,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:42:41,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:42:41,719 INFO L87 Difference]: Start difference. First operand 1424 states and 2365 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 7 states have internal predecessors, (74), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-28 20:43:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:09,640 INFO L93 Difference]: Finished difference Result 9910 states and 17794 transitions. [2023-11-28 20:43:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-28 20:43:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 7 states have internal predecessors, (74), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 95 [2023-11-28 20:43:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:09,687 INFO L225 Difference]: With dead ends: 9910 [2023-11-28 20:43:09,687 INFO L226 Difference]: Without dead ends: 8549 [2023-11-28 20:43:09,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=734, Invalid=2128, Unknown=0, NotChecked=0, Total=2862 [2023-11-28 20:43:09,700 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 8203 mSDsluCounter, 2480 mSDsCounter, 0 mSdLazyCounter, 5989 mSolverCounterSat, 2895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8291 SdHoareTripleChecker+Valid, 3006 SdHoareTripleChecker+Invalid, 8884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2895 IncrementalHoareTripleChecker+Valid, 5989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:09,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8291 Valid, 3006 Invalid, 8884 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2895 Valid, 5989 Invalid, 0 Unknown, 0 Unchecked, 15.6s Time] [2023-11-28 20:43:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8549 states. [2023-11-28 20:43:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8549 to 6317. [2023-11-28 20:43:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6317 states, 4940 states have (on average 1.638259109311741) internal successors, (8093), 5079 states have internal predecessors, (8093), 1096 states have call successors, (1096), 219 states have call predecessors, (1096), 280 states have return successors, (1440), 1073 states have call predecessors, (1440), 1091 states have call successors, (1440) [2023-11-28 20:43:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 10629 transitions. [2023-11-28 20:43:11,390 INFO L78 Accepts]: Start accepts. Automaton has 6317 states and 10629 transitions. Word has length 95 [2023-11-28 20:43:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:11,391 INFO L495 AbstractCegarLoop]: Abstraction has 6317 states and 10629 transitions. [2023-11-28 20:43:11,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 7 states have internal predecessors, (74), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-28 20:43:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 6317 states and 10629 transitions. [2023-11-28 20:43:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-28 20:43:11,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:11,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:43:11,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 20:43:11,393 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:11,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1945849127, now seen corresponding path program 1 times [2023-11-28 20:43:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712158157] [2023-11-28 20:43:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:11,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:43:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:12,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:43:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:12,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:12,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-28 20:43:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:43:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712158157] [2023-11-28 20:43:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712158157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:12,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-28 20:43:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558420503] [2023-11-28 20:43:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:12,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:43:12,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:43:12,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:43:12,554 INFO L87 Difference]: Start difference. First operand 6317 states and 10629 transitions. Second operand has 14 states, 13 states have (on average 6.076923076923077) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-28 20:43:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:28,431 INFO L93 Difference]: Finished difference Result 17676 states and 30633 transitions. [2023-11-28 20:43:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 20:43:28,432 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.076923076923077) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2023-11-28 20:43:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:28,476 INFO L225 Difference]: With dead ends: 17676 [2023-11-28 20:43:28,476 INFO L226 Difference]: Without dead ends: 10304 [2023-11-28 20:43:28,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2023-11-28 20:43:28,501 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 4427 mSDsluCounter, 3169 mSDsCounter, 0 mSdLazyCounter, 7304 mSolverCounterSat, 1038 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4452 SdHoareTripleChecker+Valid, 3669 SdHoareTripleChecker+Invalid, 8342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1038 IncrementalHoareTripleChecker+Valid, 7304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:28,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4452 Valid, 3669 Invalid, 8342 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1038 Valid, 7304 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2023-11-28 20:43:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10304 states. [2023-11-28 20:43:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10304 to 7983. [2023-11-28 20:43:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7983 states, 6274 states have (on average 1.6004144086707044) internal successors, (10041), 6421 states have internal predecessors, (10041), 1330 states have call successors, (1330), 305 states have call predecessors, (1330), 378 states have return successors, (1817), 1311 states have call predecessors, (1817), 1325 states have call successors, (1817) [2023-11-28 20:43:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 13188 transitions. [2023-11-28 20:43:30,607 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 13188 transitions. Word has length 102 [2023-11-28 20:43:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:30,608 INFO L495 AbstractCegarLoop]: Abstraction has 7983 states and 13188 transitions. [2023-11-28 20:43:30,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.076923076923077) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-28 20:43:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 13188 transitions. [2023-11-28 20:43:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-28 20:43:30,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:30,610 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:43:30,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 20:43:30,610 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:30,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1904419289, now seen corresponding path program 1 times [2023-11-28 20:43:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655705118] [2023-11-28 20:43:30,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:30,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:43:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:43:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-28 20:43:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-28 20:43:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:43:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:43:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655705118] [2023-11-28 20:43:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655705118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:31,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:43:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328917058] [2023-11-28 20:43:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:31,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:43:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:31,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:43:31,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:43:31,611 INFO L87 Difference]: Start difference. First operand 7983 states and 13188 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 7 states have internal predecessors, (80), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-28 20:43:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:49,938 INFO L93 Difference]: Finished difference Result 18696 states and 32245 transitions. [2023-11-28 20:43:49,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-28 20:43:49,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 7 states have internal predecessors, (80), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2023-11-28 20:43:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:49,982 INFO L225 Difference]: With dead ends: 18696 [2023-11-28 20:43:49,982 INFO L226 Difference]: Without dead ends: 10786 [2023-11-28 20:43:50,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2023-11-28 20:43:50,006 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 2956 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 6298 mSolverCounterSat, 870 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3025 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 7168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 870 IncrementalHoareTripleChecker+Valid, 6298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:50,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3025 Valid, 3152 Invalid, 7168 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [870 Valid, 6298 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-11-28 20:43:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10786 states. [2023-11-28 20:43:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10786 to 8135. [2023-11-28 20:43:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8135 states, 6350 states have (on average 1.593228346456693) internal successors, (10117), 6549 states have internal predecessors, (10117), 1354 states have call successors, (1354), 305 states have call predecessors, (1354), 430 states have return successors, (2041), 1335 states have call predecessors, (2041), 1349 states have call successors, (2041) [2023-11-28 20:43:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8135 states to 8135 states and 13512 transitions. [2023-11-28 20:43:52,146 INFO L78 Accepts]: Start accepts. Automaton has 8135 states and 13512 transitions. Word has length 105 [2023-11-28 20:43:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:52,146 INFO L495 AbstractCegarLoop]: Abstraction has 8135 states and 13512 transitions. [2023-11-28 20:43:52,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 7 states have internal predecessors, (80), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-28 20:43:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 8135 states and 13512 transitions. [2023-11-28 20:43:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-28 20:43:52,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:52,149 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:43:52,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-28 20:43:52,149 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:43:52,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:52,149 INFO L85 PathProgramCache]: Analyzing trace with hash 816490285, now seen corresponding path program 1 times [2023-11-28 20:43:52,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:43:52,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732758544] [2023-11-28 20:43:52,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:43:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:52,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:52,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:43:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:43:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:52,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:53,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:43:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:53,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:43:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:53,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:43:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:53,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:43:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-28 20:43:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:43:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-28 20:43:53,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:43:53,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732758544] [2023-11-28 20:43:53,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732758544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:43:53,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:43:53,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:43:53,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075370424] [2023-11-28 20:43:53,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:43:53,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:43:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:43:53,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:43:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:43:53,181 INFO L87 Difference]: Start difference. First operand 8135 states and 13512 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 7 states have internal predecessors, (80), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-28 20:44:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:08,898 INFO L93 Difference]: Finished difference Result 19923 states and 34209 transitions. [2023-11-28 20:44:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-28 20:44:08,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 7 states have internal predecessors, (80), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2023-11-28 20:44:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:08,961 INFO L225 Difference]: With dead ends: 19923 [2023-11-28 20:44:08,961 INFO L226 Difference]: Without dead ends: 11862 [2023-11-28 20:44:08,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2023-11-28 20:44:08,986 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 5224 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 4943 mSolverCounterSat, 1660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5289 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 6603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1660 IncrementalHoareTripleChecker+Valid, 4943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:08,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5289 Valid, 2447 Invalid, 6603 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1660 Valid, 4943 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2023-11-28 20:44:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2023-11-28 20:44:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 9307. [2023-11-28 20:44:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9307 states, 7286 states have (on average 1.5730167444413945) internal successors, (11461), 7513 states have internal predecessors, (11461), 1498 states have call successors, (1498), 381 states have call predecessors, (1498), 522 states have return successors, (2321), 1467 states have call predecessors, (2321), 1493 states have call successors, (2321) [2023-11-28 20:44:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9307 states to 9307 states and 15280 transitions. [2023-11-28 20:44:11,570 INFO L78 Accepts]: Start accepts. Automaton has 9307 states and 15280 transitions. Word has length 107 [2023-11-28 20:44:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:11,571 INFO L495 AbstractCegarLoop]: Abstraction has 9307 states and 15280 transitions. [2023-11-28 20:44:11,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 7 states have internal predecessors, (80), 4 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-28 20:44:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 9307 states and 15280 transitions. [2023-11-28 20:44:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-28 20:44:11,573 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:11,573 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:44:11,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-28 20:44:11,574 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:11,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:11,574 INFO L85 PathProgramCache]: Analyzing trace with hash -18075011, now seen corresponding path program 1 times [2023-11-28 20:44:11,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:44:11,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107087066] [2023-11-28 20:44:11,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:44:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:44:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:11,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:44:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:44:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:44:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:44:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:44:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-28 20:44:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:44:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:44:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-28 20:44:12,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:44:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107087066] [2023-11-28 20:44:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107087066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:44:12,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:44:12,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:44:12,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142214460] [2023-11-28 20:44:12,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:44:12,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:44:12,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:44:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:44:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:44:12,658 INFO L87 Difference]: Start difference. First operand 9307 states and 15280 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-28 20:44:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:23,335 INFO L93 Difference]: Finished difference Result 11902 states and 20400 transitions. [2023-11-28 20:44:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-28 20:44:23,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2023-11-28 20:44:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:23,384 INFO L225 Difference]: With dead ends: 11902 [2023-11-28 20:44:23,384 INFO L226 Difference]: Without dead ends: 11887 [2023-11-28 20:44:23,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2023-11-28 20:44:23,392 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 3167 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 3717 mSolverCounterSat, 1019 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3181 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 4736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1019 IncrementalHoareTripleChecker+Valid, 3717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:23,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3181 Valid, 1665 Invalid, 4736 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1019 Valid, 3717 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-11-28 20:44:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2023-11-28 20:44:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 9315. [2023-11-28 20:44:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9315 states, 7294 states have (on average 1.572388264326844) internal successors, (11469), 7521 states have internal predecessors, (11469), 1498 states have call successors, (1498), 381 states have call predecessors, (1498), 522 states have return successors, (2321), 1467 states have call predecessors, (2321), 1493 states have call successors, (2321) [2023-11-28 20:44:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9315 states to 9315 states and 15288 transitions. [2023-11-28 20:44:26,022 INFO L78 Accepts]: Start accepts. Automaton has 9315 states and 15288 transitions. Word has length 111 [2023-11-28 20:44:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:26,022 INFO L495 AbstractCegarLoop]: Abstraction has 9315 states and 15288 transitions. [2023-11-28 20:44:26,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-28 20:44:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 9315 states and 15288 transitions. [2023-11-28 20:44:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-28 20:44:26,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:26,025 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:44:26,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-28 20:44:26,025 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:26,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:26,025 INFO L85 PathProgramCache]: Analyzing trace with hash -134764536, now seen corresponding path program 1 times [2023-11-28 20:44:26,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:44:26,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265744733] [2023-11-28 20:44:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:44:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:26,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:44:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:26,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:26,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:44:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:44:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:44:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:44:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:44:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:44:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:44:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:44:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:44:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:44:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-28 20:44:27,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:44:27,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265744733] [2023-11-28 20:44:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265744733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:44:27,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:44:27,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:44:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120351915] [2023-11-28 20:44:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:44:27,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:44:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:44:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:44:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:44:27,082 INFO L87 Difference]: Start difference. First operand 9315 states and 15288 transitions. Second operand has 11 states, 10 states have (on average 8.4) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-28 20:44:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:40,543 INFO L93 Difference]: Finished difference Result 12445 states and 21353 transitions. [2023-11-28 20:44:40,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-28 20:44:40,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 118 [2023-11-28 20:44:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:40,585 INFO L225 Difference]: With dead ends: 12445 [2023-11-28 20:44:40,585 INFO L226 Difference]: Without dead ends: 12430 [2023-11-28 20:44:40,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2023-11-28 20:44:40,592 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 1991 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 4497 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 5112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 4497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:40,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 2478 Invalid, 5112 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [615 Valid, 4497 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-28 20:44:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12430 states. [2023-11-28 20:44:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12430 to 9703. [2023-11-28 20:44:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9703 states, 7583 states have (on average 1.5670578926546221) internal successors, (11883), 7810 states have internal predecessors, (11883), 1562 states have call successors, (1562), 421 states have call predecessors, (1562), 557 states have return successors, (2436), 1526 states have call predecessors, (2436), 1557 states have call successors, (2436) [2023-11-28 20:44:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9703 states to 9703 states and 15881 transitions. [2023-11-28 20:44:43,375 INFO L78 Accepts]: Start accepts. Automaton has 9703 states and 15881 transitions. Word has length 118 [2023-11-28 20:44:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:43,375 INFO L495 AbstractCegarLoop]: Abstraction has 9703 states and 15881 transitions. [2023-11-28 20:44:43,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-28 20:44:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 9703 states and 15881 transitions. [2023-11-28 20:44:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-28 20:44:43,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:43,378 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:44:43,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-28 20:44:43,378 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:44:43,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:43,378 INFO L85 PathProgramCache]: Analyzing trace with hash 311289350, now seen corresponding path program 1 times [2023-11-28 20:44:43,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:44:43,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545841835] [2023-11-28 20:44:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:44:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:44:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:44:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:43,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:44:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:44:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:44:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:44:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:44:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:44:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:44:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:44:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:44:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:44:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:44:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-28 20:44:44,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:44:44,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545841835] [2023-11-28 20:44:44,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545841835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:44:44,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:44:44,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-28 20:44:44,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939553974] [2023-11-28 20:44:44,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:44:44,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:44:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:44:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:44:44,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:44:44,513 INFO L87 Difference]: Start difference. First operand 9703 states and 15881 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-28 20:44:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:58,151 INFO L93 Difference]: Finished difference Result 22167 states and 37965 transitions. [2023-11-28 20:44:58,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:44:58,151 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2023-11-28 20:44:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:58,198 INFO L225 Difference]: With dead ends: 22167 [2023-11-28 20:44:58,198 INFO L226 Difference]: Without dead ends: 12541 [2023-11-28 20:44:58,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2023-11-28 20:44:58,226 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 1863 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 5891 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 6447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 5891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:58,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 2179 Invalid, 6447 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [556 Valid, 5891 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-11-28 20:44:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12541 states. [2023-11-28 20:45:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12541 to 9775. [2023-11-28 20:45:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9775 states, 7637 states have (on average 1.5575487756972632) internal successors, (11895), 7864 states have internal predecessors, (11895), 1562 states have call successors, (1562), 421 states have call predecessors, (1562), 575 states have return successors, (2598), 1544 states have call predecessors, (2598), 1557 states have call successors, (2598) [2023-11-28 20:45:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 16055 transitions. [2023-11-28 20:45:01,128 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 16055 transitions. Word has length 127 [2023-11-28 20:45:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:45:01,128 INFO L495 AbstractCegarLoop]: Abstraction has 9775 states and 16055 transitions. [2023-11-28 20:45:01,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 6 states have internal predecessors, (88), 3 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-28 20:45:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 16055 transitions. [2023-11-28 20:45:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-28 20:45:01,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:45:01,131 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-28 20:45:01,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-28 20:45:01,131 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:45:01,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:45:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1850348186, now seen corresponding path program 1 times [2023-11-28 20:45:01,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:45:01,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786935855] [2023-11-28 20:45:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:45:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:45:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:45:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:45:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:45:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:45:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:45:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:45:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:45:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:45:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:45:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:45:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:45:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:45:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-28 20:45:02,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:45:02,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786935855] [2023-11-28 20:45:02,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786935855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:45:02,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:45:02,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:45:02,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526137371] [2023-11-28 20:45:02,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:45:02,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:45:02,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:45:02,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:45:02,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:45:02,073 INFO L87 Difference]: Start difference. First operand 9775 states and 16055 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-28 20:45:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:45:24,969 INFO L93 Difference]: Finished difference Result 34422 states and 61007 transitions. [2023-11-28 20:45:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 20:45:24,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2023-11-28 20:45:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:45:25,086 INFO L225 Difference]: With dead ends: 34422 [2023-11-28 20:45:25,086 INFO L226 Difference]: Without dead ends: 24730 [2023-11-28 20:45:25,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2023-11-28 20:45:25,126 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 4446 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 4381 mSolverCounterSat, 1365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4513 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1365 IncrementalHoareTripleChecker+Valid, 4381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:45:25,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4513 Valid, 2031 Invalid, 5746 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1365 Valid, 4381 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2023-11-28 20:45:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24730 states. [2023-11-28 20:45:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24730 to 17283. [2023-11-28 20:45:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17283 states, 13273 states have (on average 1.5444888118737286) internal successors, (20500), 13775 states have internal predecessors, (20500), 2973 states have call successors, (2973), 721 states have call predecessors, (2973), 1036 states have return successors, (5202), 2976 states have call predecessors, (5202), 2968 states have call successors, (5202) [2023-11-28 20:45:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17283 states to 17283 states and 28675 transitions. [2023-11-28 20:45:30,903 INFO L78 Accepts]: Start accepts. Automaton has 17283 states and 28675 transitions. Word has length 128 [2023-11-28 20:45:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:45:30,904 INFO L495 AbstractCegarLoop]: Abstraction has 17283 states and 28675 transitions. [2023-11-28 20:45:30,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-28 20:45:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 17283 states and 28675 transitions. [2023-11-28 20:45:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-28 20:45:30,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:45:30,907 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2023-11-28 20:45:30,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-28 20:45:30,908 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:45:30,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:45:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash 233777966, now seen corresponding path program 1 times [2023-11-28 20:45:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:45:30,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640708643] [2023-11-28 20:45:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:45:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:45:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:45:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:31,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:45:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:31,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:45:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:31,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:45:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:45:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:45:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:45:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:45:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:45:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:45:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:45:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:45:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:45:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-28 20:45:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-28 20:45:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:45:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640708643] [2023-11-28 20:45:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640708643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:45:32,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:45:32,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:45:32,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953116899] [2023-11-28 20:45:32,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:45:32,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:45:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:45:32,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:45:32,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:45:32,103 INFO L87 Difference]: Start difference. First operand 17283 states and 28675 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-28 20:46:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:46:03,280 INFO L93 Difference]: Finished difference Result 64063 states and 123126 transitions. [2023-11-28 20:46:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-28 20:46:03,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 136 [2023-11-28 20:46:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:46:03,586 INFO L225 Difference]: With dead ends: 64063 [2023-11-28 20:46:03,586 INFO L226 Difference]: Without dead ends: 46851 [2023-11-28 20:46:03,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=175, Invalid=331, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:46:03,800 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 4039 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 1033 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4113 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1033 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:46:03,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4113 Valid, 1961 Invalid, 3907 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1033 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2023-11-28 20:46:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46851 states. [2023-11-28 20:46:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46851 to 32192. [2023-11-28 20:46:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32192 states, 24344 states have (on average 1.543008544199803) internal successors, (37563), 25397 states have internal predecessors, (37563), 5917 states have call successors, (5917), 1263 states have call predecessors, (5917), 1930 states have return successors, (11928), 6011 states have call predecessors, (11928), 5912 states have call successors, (11928) [2023-11-28 20:46:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32192 states to 32192 states and 55408 transitions. [2023-11-28 20:46:15,812 INFO L78 Accepts]: Start accepts. Automaton has 32192 states and 55408 transitions. Word has length 136 [2023-11-28 20:46:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:46:15,812 INFO L495 AbstractCegarLoop]: Abstraction has 32192 states and 55408 transitions. [2023-11-28 20:46:15,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 6 states have internal predecessors, (93), 5 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-28 20:46:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 32192 states and 55408 transitions. [2023-11-28 20:46:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-28 20:46:15,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:46:15,820 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-28 20:46:15,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-28 20:46:15,820 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:46:15,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:46:15,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1790127151, now seen corresponding path program 1 times [2023-11-28 20:46:15,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:46:15,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545221553] [2023-11-28 20:46:15,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:46:15,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:46:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:46:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:46:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:46:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:46:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:46:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:46:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:46:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-28 20:46:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-28 20:46:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:46:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-28 20:46:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-28 20:46:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-28 20:46:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-28 20:46:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:46:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545221553] [2023-11-28 20:46:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545221553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:46:16,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:46:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:46:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13835489] [2023-11-28 20:46:16,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:46:16,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:46:16,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:46:16,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:46:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:46:16,933 INFO L87 Difference]: Start difference. First operand 32192 states and 55408 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 6 states have internal predecessors, (92), 5 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-28 20:47:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:11,947 INFO L93 Difference]: Finished difference Result 132090 states and 291877 transitions. [2023-11-28 20:47:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-28 20:47:11,948 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 6 states have internal predecessors, (92), 5 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 135 [2023-11-28 20:47:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:13,286 INFO L225 Difference]: With dead ends: 132090 [2023-11-28 20:47:13,286 INFO L226 Difference]: Without dead ends: 99969 [2023-11-28 20:47:13,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=175, Invalid=331, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:47:13,586 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 3491 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 3153 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3570 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 4063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 3153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:13,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3570 Valid, 2075 Invalid, 4063 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [910 Valid, 3153 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2023-11-28 20:47:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99969 states. [2023-11-28 20:47:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99969 to 65917. [2023-11-28 20:47:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65917 states, 48976 states have (on average 1.542878144397256) internal successors, (75564), 51356 states have internal predecessors, (75564), 13057 states have call successors, (13057), 2347 states have call predecessors, (13057), 3883 states have return successors, (32290), 13453 states have call predecessors, (32290), 13052 states have call successors, (32290) [2023-11-28 20:47:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65917 states to 65917 states and 120911 transitions. [2023-11-28 20:47:42,151 INFO L78 Accepts]: Start accepts. Automaton has 65917 states and 120911 transitions. Word has length 135 [2023-11-28 20:47:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:42,151 INFO L495 AbstractCegarLoop]: Abstraction has 65917 states and 120911 transitions. [2023-11-28 20:47:42,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 6 states have internal predecessors, (92), 5 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-28 20:47:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 65917 states and 120911 transitions. [2023-11-28 20:47:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-28 20:47:42,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:42,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2023-11-28 20:47:42,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-28 20:47:42,159 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:47:42,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1318197552, now seen corresponding path program 1 times [2023-11-28 20:47:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:47:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413149193] [2023-11-28 20:47:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:47:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:47:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:42,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:47:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:42,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:42,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:47:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:42,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:47:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:47:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:47:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:47:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:47:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:47:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:47:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:47:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:47:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:47:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-28 20:47:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-28 20:47:43,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:47:43,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413149193] [2023-11-28 20:47:43,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413149193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:47:43,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:47:43,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:47:43,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539260779] [2023-11-28 20:47:43,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:47:43,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:47:43,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:47:43,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:47:43,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:47:43,258 INFO L87 Difference]: Start difference. First operand 65917 states and 120911 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-28 20:49:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:49:46,125 INFO L93 Difference]: Finished difference Result 293785 states and 803059 transitions. [2023-11-28 20:49:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-28 20:49:46,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 138 [2023-11-28 20:49:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:49:50,105 INFO L225 Difference]: With dead ends: 293785 [2023-11-28 20:49:50,105 INFO L226 Difference]: Without dead ends: 227939 [2023-11-28 20:49:51,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=175, Invalid=331, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:49:51,176 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 5279 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 2757 mSolverCounterSat, 1384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5358 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 4141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1384 IncrementalHoareTripleChecker+Valid, 2757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:49:51,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5358 Valid, 1821 Invalid, 4141 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1384 Valid, 2757 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-11-28 20:49:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227939 states. [2023-11-28 20:51:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227939 to 144282. [2023-11-28 20:51:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144282 states, 105247 states have (on average 1.5432268853268978) internal successors, (162420), 110871 states have internal predecessors, (162420), 30795 states have call successors, (30795), 4515 states have call predecessors, (30795), 8239 states have return successors, (98832), 32155 states have call predecessors, (98832), 30790 states have call successors, (98832) [2023-11-28 20:51:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144282 states to 144282 states and 292047 transitions. [2023-11-28 20:51:05,921 INFO L78 Accepts]: Start accepts. Automaton has 144282 states and 292047 transitions. Word has length 138 [2023-11-28 20:51:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:51:05,922 INFO L495 AbstractCegarLoop]: Abstraction has 144282 states and 292047 transitions. [2023-11-28 20:51:05,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-28 20:51:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 144282 states and 292047 transitions. [2023-11-28 20:51:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-28 20:51:05,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:51:05,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2023-11-28 20:51:05,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-28 20:51:05,930 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:51:05,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:51:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2085670170, now seen corresponding path program 1 times [2023-11-28 20:51:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:51:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725484471] [2023-11-28 20:51:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:51:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:51:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:06,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:51:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:06,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:51:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-28 20:51:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:06,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:51:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:06,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:51:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:06,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:51:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:51:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-28 20:51:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 20:51:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:51:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-28 20:51:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-28 20:51:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:51:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:51:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-28 20:51:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:51:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-28 20:51:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:51:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-28 20:51:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:51:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725484471] [2023-11-28 20:51:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725484471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:51:07,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:51:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:51:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439503579] [2023-11-28 20:51:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:51:07,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:51:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:51:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:51:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:51:07,213 INFO L87 Difference]: Start difference. First operand 144282 states and 292047 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17)