./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:16:24,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:16:25,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:16:25,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:16:25,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:16:25,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:16:25,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:16:25,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:16:25,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:16:25,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:16:25,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:16:25,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:16:25,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:16:25,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:16:25,072 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:16:25,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:16:25,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:16:25,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:16:25,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:16:25,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:16:25,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:16:25,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:16:25,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:16:25,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:16:25,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:16:25,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:16:25,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:16:25,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:16:25,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:16:25,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:16:25,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:16:25,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:16:25,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:16:25,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:16:25,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:16:25,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:16:25,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:16:25,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:16:25,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:16:25,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:16:25,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:16:25,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:16:25,084 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 [2024-10-12 19:16:25,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:16:25,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:16:25,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:16:25,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:16:25,302 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:16:25,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2024-10-12 19:16:26,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:16:26,741 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:16:26,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2024-10-12 19:16:26,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e83a447e/2f873fe37625421794116e9763960538/FLAGb70c6d7e9 [2024-10-12 19:16:27,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e83a447e/2f873fe37625421794116e9763960538 [2024-10-12 19:16:27,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:16:27,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:16:27,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:16:27,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:16:27,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:16:27,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218ab4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27, skipping insertion in model container [2024-10-12 19:16:27,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:16:27,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2024-10-12 19:16:27,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:16:27,484 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:16:27,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2024-10-12 19:16:27,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [150] [2024-10-12 19:16:27,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [164] [2024-10-12 19:16:27,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [284] [2024-10-12 19:16:27,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [322] [2024-10-12 19:16:27,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1825] [2024-10-12 19:16:27,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1834] [2024-10-12 19:16:27,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2200] [2024-10-12 19:16:27,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2552] [2024-10-12 19:16:27,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2733] [2024-10-12 19:16:27,594 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c[38051,38064] [2024-10-12 19:16:27,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:16:27,656 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:16:27,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27 WrapperNode [2024-10-12 19:16:27,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:16:27,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:16:27,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:16:27,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:16:27,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,720 INFO L138 Inliner]: procedures = 92, calls = 338, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 816 [2024-10-12 19:16:27,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:16:27,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:16:27,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:16:27,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:16:27,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,753 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]. [2024-10-12 19:16:27,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:16:27,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:16:27,795 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:16:27,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:16:27,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (1/1) ... [2024-10-12 19:16:27,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:16:27,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:16:27,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:16:27,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:16:27,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:16:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:16:27,861 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:16:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-12 19:16:27,861 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-12 19:16:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:16:27,861 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:16:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:16:27,861 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:16:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:16:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:16:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:16:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:16:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:16:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:16:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-12 19:16:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-12 19:16:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:16:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:16:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:16:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:16:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:16:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:16:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:16:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:16:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:16:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:16:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:16:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:16:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:16:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:16:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:16:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:16:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:16:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:16:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:16:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:16:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:16:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:16:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:16:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2024-10-12 19:16:27,866 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2024-10-12 19:16:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:16:27,866 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:16:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:16:27,866 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:16:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:16:27,866 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:16:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:16:27,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:16:27,867 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:16:27,867 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:16:27,991 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:16:27,995 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:16:28,847 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2024-10-12 19:16:28,848 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:16:28,926 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:16:28,926 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:16:28,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:16:28 BoogieIcfgContainer [2024-10-12 19:16:28,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:16:28,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:16:28,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:16:28,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:16:28,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:16:27" (1/3) ... [2024-10-12 19:16:28,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d9d0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:16:28, skipping insertion in model container [2024-10-12 19:16:28,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:16:27" (2/3) ... [2024-10-12 19:16:28,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d9d0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:16:28, skipping insertion in model container [2024-10-12 19:16:28,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:16:28" (3/3) ... [2024-10-12 19:16:28,936 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2024-10-12 19:16:28,949 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:16:28,949 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:16:29,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:16:29,011 INFO L333 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, 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;@5f093885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:16:29,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:16:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 520 states, 405 states have (on average 1.7432098765432098) internal successors, (706), 428 states have internal predecessors, (706), 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) [2024-10-12 19:16:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 19:16:29,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:29,028 INFO L215 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] [2024-10-12 19:16:29,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:29,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1287879429, now seen corresponding path program 1 times [2024-10-12 19:16:29,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:29,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984198202] [2024-10-12 19:16:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:29,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:29,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:16:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:16:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:30,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:30,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:16:30,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:30,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984198202] [2024-10-12 19:16:30,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984198202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:30,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:30,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:30,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184885549] [2024-10-12 19:16:30,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:30,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:30,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:30,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:30,059 INFO L87 Difference]: Start difference. First operand has 520 states, 405 states have (on average 1.7432098765432098) internal successors, (706), 428 states have internal predecessors, (706), 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) [2024-10-12 19:16:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:34,025 INFO L93 Difference]: Finished difference Result 1183 states and 2044 transitions. [2024-10-12 19:16:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:16:34,027 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 [2024-10-12 19:16:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:34,046 INFO L225 Difference]: With dead ends: 1183 [2024-10-12 19:16:34,046 INFO L226 Difference]: Without dead ends: 672 [2024-10-12 19:16:34,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:16:34,059 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 652 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 2770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:34,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1061 Invalid, 2770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 19:16:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-12 19:16:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 516. [2024-10-12 19:16:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 403 states have (on average 1.7320099255583126) internal successors, (698), 424 states have internal predecessors, (698), 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) [2024-10-12 19:16:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 875 transitions. [2024-10-12 19:16:34,195 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 875 transitions. Word has length 46 [2024-10-12 19:16:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:34,197 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 875 transitions. [2024-10-12 19:16:34,198 INFO L472 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) [2024-10-12 19:16:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 875 transitions. [2024-10-12 19:16:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 19:16:34,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:34,205 INFO L215 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] [2024-10-12 19:16:34,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:16:34,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:34,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1240640742, now seen corresponding path program 1 times [2024-10-12 19:16:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:34,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81233566] [2024-10-12 19:16:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:16:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:16:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:34,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:34,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:16:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:34,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81233566] [2024-10-12 19:16:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81233566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:34,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:34,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264132166] [2024-10-12 19:16:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:34,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:34,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:34,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:34,715 INFO L87 Difference]: Start difference. First operand 516 states and 875 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) [2024-10-12 19:16:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:38,134 INFO L93 Difference]: Finished difference Result 1176 states and 2017 transitions. [2024-10-12 19:16:38,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:16:38,135 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 [2024-10-12 19:16:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:38,140 INFO L225 Difference]: With dead ends: 1176 [2024-10-12 19:16:38,140 INFO L226 Difference]: Without dead ends: 672 [2024-10-12 19:16:38,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:16:38,142 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 650 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 2640 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:38,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1049 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2640 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 19:16:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-12 19:16:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 516. [2024-10-12 19:16:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 403 states have (on average 1.7295285359801489) internal successors, (697), 424 states have internal predecessors, (697), 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) [2024-10-12 19:16:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 874 transitions. [2024-10-12 19:16:38,204 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 874 transitions. Word has length 48 [2024-10-12 19:16:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:38,204 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 874 transitions. [2024-10-12 19:16:38,204 INFO L472 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) [2024-10-12 19:16:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 874 transitions. [2024-10-12 19:16:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:16:38,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:38,209 INFO L215 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] [2024-10-12 19:16:38,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:16:38,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:38,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1676540694, now seen corresponding path program 1 times [2024-10-12 19:16:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:38,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214806429] [2024-10-12 19:16:38,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:38,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:38,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:16:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:38,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 19:16:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:38,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:16:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:38,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214806429] [2024-10-12 19:16:38,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214806429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:38,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:38,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318868431] [2024-10-12 19:16:38,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:38,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:38,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:38,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:38,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:38,691 INFO L87 Difference]: Start difference. First operand 516 states and 874 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) [2024-10-12 19:16:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:41,888 INFO L93 Difference]: Finished difference Result 1176 states and 2016 transitions. [2024-10-12 19:16:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:16:41,889 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 [2024-10-12 19:16:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:41,892 INFO L225 Difference]: With dead ends: 1176 [2024-10-12 19:16:41,892 INFO L226 Difference]: Without dead ends: 672 [2024-10-12 19:16:41,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:16:41,895 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 647 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 2640 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:41,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1067 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2640 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:16:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-12 19:16:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 516. [2024-10-12 19:16:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 403 states have (on average 1.7270471464019852) internal successors, (696), 424 states have internal predecessors, (696), 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) [2024-10-12 19:16:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 873 transitions. [2024-10-12 19:16:41,945 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 873 transitions. Word has length 49 [2024-10-12 19:16:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:41,945 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 873 transitions. [2024-10-12 19:16:41,945 INFO L472 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) [2024-10-12 19:16:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 873 transitions. [2024-10-12 19:16:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:16:41,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:41,947 INFO L215 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] [2024-10-12 19:16:41,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:16:41,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:41,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1457243874, now seen corresponding path program 1 times [2024-10-12 19:16:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:41,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315752654] [2024-10-12 19:16:41,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:41,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:42,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:42,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:16:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:42,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:16:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:16:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315752654] [2024-10-12 19:16:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315752654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:42,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455335865] [2024-10-12 19:16:42,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:42,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:42,391 INFO L87 Difference]: Start difference. First operand 516 states and 873 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) [2024-10-12 19:16:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:45,564 INFO L93 Difference]: Finished difference Result 1176 states and 2015 transitions. [2024-10-12 19:16:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:16:45,569 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 [2024-10-12 19:16:45,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:45,574 INFO L225 Difference]: With dead ends: 1176 [2024-10-12 19:16:45,574 INFO L226 Difference]: Without dead ends: 672 [2024-10-12 19:16:45,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:16:45,577 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 646 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:45,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1049 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 19:16:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-12 19:16:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 516. [2024-10-12 19:16:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 403 states have (on average 1.7245657568238213) internal successors, (695), 424 states have internal predecessors, (695), 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) [2024-10-12 19:16:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 872 transitions. [2024-10-12 19:16:45,632 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 872 transitions. Word has length 50 [2024-10-12 19:16:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:45,632 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 872 transitions. [2024-10-12 19:16:45,632 INFO L472 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) [2024-10-12 19:16:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 872 transitions. [2024-10-12 19:16:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 19:16:45,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:45,634 INFO L215 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] [2024-10-12 19:16:45,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:16:45,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:45,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1893283694, now seen corresponding path program 1 times [2024-10-12 19:16:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:45,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813919032] [2024-10-12 19:16:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:45,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:45,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:16:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:46,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:16:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:46,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:16:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:46,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813919032] [2024-10-12 19:16:46,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813919032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:46,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645570282] [2024-10-12 19:16:46,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:46,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:46,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:46,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:46,055 INFO L87 Difference]: Start difference. First operand 516 states and 872 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) [2024-10-12 19:16:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:49,125 INFO L93 Difference]: Finished difference Result 1176 states and 2014 transitions. [2024-10-12 19:16:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:16:49,126 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 [2024-10-12 19:16:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:49,129 INFO L225 Difference]: With dead ends: 1176 [2024-10-12 19:16:49,129 INFO L226 Difference]: Without dead ends: 672 [2024-10-12 19:16:49,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:16:49,133 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 644 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 2742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:49,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1043 Invalid, 2742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 19:16:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-12 19:16:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 516. [2024-10-12 19:16:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 403 states have (on average 1.7220843672456576) internal successors, (694), 424 states have internal predecessors, (694), 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) [2024-10-12 19:16:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 871 transitions. [2024-10-12 19:16:49,188 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 871 transitions. Word has length 51 [2024-10-12 19:16:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:49,189 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 871 transitions. [2024-10-12 19:16:49,189 INFO L472 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) [2024-10-12 19:16:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 871 transitions. [2024-10-12 19:16:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:16:49,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:49,191 INFO L215 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] [2024-10-12 19:16:49,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:16:49,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:49,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1592056355, now seen corresponding path program 1 times [2024-10-12 19:16:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:49,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739841365] [2024-10-12 19:16:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:49,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:49,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:49,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:16:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:49,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:16:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:49,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:49,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:16:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739841365] [2024-10-12 19:16:49,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739841365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:49,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:49,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:49,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820271969] [2024-10-12 19:16:49,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:49,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:49,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:49,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:49,580 INFO L87 Difference]: Start difference. First operand 516 states and 871 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) [2024-10-12 19:16:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:52,200 INFO L93 Difference]: Finished difference Result 1146 states and 1953 transitions. [2024-10-12 19:16:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:16:52,201 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 [2024-10-12 19:16:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:52,204 INFO L225 Difference]: With dead ends: 1146 [2024-10-12 19:16:52,204 INFO L226 Difference]: Without dead ends: 682 [2024-10-12 19:16:52,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:16:52,206 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1128 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 2438 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:52,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 1065 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2438 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:16:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-10-12 19:16:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 516. [2024-10-12 19:16:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 403 states have (on average 1.7096774193548387) internal successors, (689), 424 states have internal predecessors, (689), 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) [2024-10-12 19:16:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 866 transitions. [2024-10-12 19:16:52,255 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 866 transitions. Word has length 52 [2024-10-12 19:16:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:52,255 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 866 transitions. [2024-10-12 19:16:52,255 INFO L472 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) [2024-10-12 19:16:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 866 transitions. [2024-10-12 19:16:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:16:52,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:52,256 INFO L215 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] [2024-10-12 19:16:52,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:16:52,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:52,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash 399917956, now seen corresponding path program 1 times [2024-10-12 19:16:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:52,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499790565] [2024-10-12 19:16:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:52,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:52,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:16:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:16:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:52,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:16:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499790565] [2024-10-12 19:16:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499790565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:52,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:52,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:52,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718550442] [2024-10-12 19:16:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:52,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:52,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:52,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:52,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:52,650 INFO L87 Difference]: Start difference. First operand 516 states and 866 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) [2024-10-12 19:16:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:55,415 INFO L93 Difference]: Finished difference Result 1146 states and 1948 transitions. [2024-10-12 19:16:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:16:55,416 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 [2024-10-12 19:16:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:55,419 INFO L225 Difference]: With dead ends: 1146 [2024-10-12 19:16:55,419 INFO L226 Difference]: Without dead ends: 682 [2024-10-12 19:16:55,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:16:55,421 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1130 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:55,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 1050 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 19:16:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-10-12 19:16:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 516. [2024-10-12 19:16:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 403 states have (on average 1.6972704714640199) internal successors, (684), 424 states have internal predecessors, (684), 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) [2024-10-12 19:16:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 861 transitions. [2024-10-12 19:16:55,473 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 861 transitions. Word has length 53 [2024-10-12 19:16:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:55,474 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 861 transitions. [2024-10-12 19:16:55,474 INFO L472 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) [2024-10-12 19:16:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 861 transitions. [2024-10-12 19:16:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 19:16:55,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:55,475 INFO L215 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] [2024-10-12 19:16:55,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:16:55,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:55,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:55,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1364141346, now seen corresponding path program 1 times [2024-10-12 19:16:55,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:55,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829289172] [2024-10-12 19:16:55,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:16:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:16:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:16:55,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:55,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829289172] [2024-10-12 19:16:55,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829289172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:55,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:55,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:55,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488642362] [2024-10-12 19:16:55,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:55,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:55,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:55,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:55,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:55,858 INFO L87 Difference]: Start difference. First operand 516 states and 861 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) [2024-10-12 19:16:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:16:58,428 INFO L93 Difference]: Finished difference Result 1146 states and 1943 transitions. [2024-10-12 19:16:58,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:16:58,428 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 [2024-10-12 19:16:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:16:58,432 INFO L225 Difference]: With dead ends: 1146 [2024-10-12 19:16:58,432 INFO L226 Difference]: Without dead ends: 682 [2024-10-12 19:16:58,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:16:58,433 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1123 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:16:58,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 1065 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:16:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-10-12 19:16:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 516. [2024-10-12 19:16:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 403 states have (on average 1.684863523573201) internal successors, (679), 424 states have internal predecessors, (679), 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) [2024-10-12 19:16:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 856 transitions. [2024-10-12 19:16:58,484 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 856 transitions. Word has length 54 [2024-10-12 19:16:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:16:58,484 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 856 transitions. [2024-10-12 19:16:58,484 INFO L472 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) [2024-10-12 19:16:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 856 transitions. [2024-10-12 19:16:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 19:16:58,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:16:58,485 INFO L215 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] [2024-10-12 19:16:58,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:16:58,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:16:58,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:16:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1396846494, now seen corresponding path program 1 times [2024-10-12 19:16:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:16:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292378401] [2024-10-12 19:16:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:16:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:16:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:16:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:58,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:16:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:16:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:16:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:16:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:16:58,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:16:58,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292378401] [2024-10-12 19:16:58,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292378401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:16:58,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:16:58,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:16:58,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052170975] [2024-10-12 19:16:58,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:16:58,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:16:58,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:16:58,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:16:58,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:16:58,857 INFO L87 Difference]: Start difference. First operand 516 states and 856 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), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:01,658 INFO L93 Difference]: Finished difference Result 1134 states and 1918 transitions. [2024-10-12 19:17:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:17:01,659 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), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2024-10-12 19:17:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:01,662 INFO L225 Difference]: With dead ends: 1134 [2024-10-12 19:17:01,662 INFO L226 Difference]: Without dead ends: 676 [2024-10-12 19:17:01,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:01,664 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1112 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:01,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 1015 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:17:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-12 19:17:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 518. [2024-10-12 19:17:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 405 states have (on average 1.6814814814814816) internal successors, (681), 426 states have internal predecessors, (681), 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) [2024-10-12 19:17:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 858 transitions. [2024-10-12 19:17:01,716 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 858 transitions. Word has length 55 [2024-10-12 19:17:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:01,716 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 858 transitions. [2024-10-12 19:17:01,716 INFO L472 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), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:17:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 858 transitions. [2024-10-12 19:17:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 19:17:01,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:01,717 INFO L215 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] [2024-10-12 19:17:01,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:17:01,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:01,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash 617087839, now seen corresponding path program 1 times [2024-10-12 19:17:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:01,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937852665] [2024-10-12 19:17:01,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:01,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:01,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:01,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:01,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:17:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:02,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:02,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:02,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937852665] [2024-10-12 19:17:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937852665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:02,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220165557] [2024-10-12 19:17:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:02,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:02,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:02,155 INFO L87 Difference]: Start difference. First operand 518 states and 858 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) [2024-10-12 19:17:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:04,809 INFO L93 Difference]: Finished difference Result 1152 states and 1943 transitions. [2024-10-12 19:17:04,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:04,809 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 [2024-10-12 19:17:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:04,812 INFO L225 Difference]: With dead ends: 1152 [2024-10-12 19:17:04,812 INFO L226 Difference]: Without dead ends: 686 [2024-10-12 19:17:04,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:04,814 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1129 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 2645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:04,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1024 Invalid, 2645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:17:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-12 19:17:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 518. [2024-10-12 19:17:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 405 states have (on average 1.6691358024691358) internal successors, (676), 426 states have internal predecessors, (676), 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) [2024-10-12 19:17:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 853 transitions. [2024-10-12 19:17:04,866 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 853 transitions. Word has length 55 [2024-10-12 19:17:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:04,866 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 853 transitions. [2024-10-12 19:17:04,866 INFO L472 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) [2024-10-12 19:17:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 853 transitions. [2024-10-12 19:17:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:17:04,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:04,867 INFO L215 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] [2024-10-12 19:17:04,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:17:04,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:04,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash -741209604, now seen corresponding path program 1 times [2024-10-12 19:17:04,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:04,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880112466] [2024-10-12 19:17:04,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:04,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:17:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880112466] [2024-10-12 19:17:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880112466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224578463] [2024-10-12 19:17:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:05,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:05,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:05,299 INFO L87 Difference]: Start difference. First operand 518 states and 853 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) [2024-10-12 19:17:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:09,069 INFO L93 Difference]: Finished difference Result 1148 states and 1930 transitions. [2024-10-12 19:17:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:17:09,070 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 [2024-10-12 19:17:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:09,073 INFO L225 Difference]: With dead ends: 1148 [2024-10-12 19:17:09,073 INFO L226 Difference]: Without dead ends: 690 [2024-10-12 19:17:09,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:17:09,075 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1116 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 4440 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 4701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 4440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:09,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1835 Invalid, 4701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 4440 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:17:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-12 19:17:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 521. [2024-10-12 19:17:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 408 states have (on average 1.6642156862745099) internal successors, (679), 429 states have internal predecessors, (679), 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) [2024-10-12 19:17:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 856 transitions. [2024-10-12 19:17:09,127 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 856 transitions. Word has length 56 [2024-10-12 19:17:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:09,127 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 856 transitions. [2024-10-12 19:17:09,127 INFO L472 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) [2024-10-12 19:17:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 856 transitions. [2024-10-12 19:17:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:17:09,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:09,128 INFO L215 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] [2024-10-12 19:17:09,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:17:09,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:09,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:09,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1556824167, now seen corresponding path program 1 times [2024-10-12 19:17:09,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:09,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924817690] [2024-10-12 19:17:09,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:09,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:17:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:09,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:09,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924817690] [2024-10-12 19:17:09,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924817690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:09,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:09,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51045585] [2024-10-12 19:17:09,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:09,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:09,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:09,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:09,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:09,502 INFO L87 Difference]: Start difference. First operand 521 states and 856 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) [2024-10-12 19:17:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:12,151 INFO L93 Difference]: Finished difference Result 1161 states and 1946 transitions. [2024-10-12 19:17:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:17:12,151 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 [2024-10-12 19:17:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:12,155 INFO L225 Difference]: With dead ends: 1161 [2024-10-12 19:17:12,155 INFO L226 Difference]: Without dead ends: 692 [2024-10-12 19:17:12,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:17:12,157 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1126 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:12,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1030 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:17:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-10-12 19:17:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 521. [2024-10-12 19:17:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 408 states have (on average 1.6519607843137254) internal successors, (674), 429 states have internal predecessors, (674), 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) [2024-10-12 19:17:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 851 transitions. [2024-10-12 19:17:12,222 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 851 transitions. Word has length 56 [2024-10-12 19:17:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:12,223 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 851 transitions. [2024-10-12 19:17:12,223 INFO L472 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) [2024-10-12 19:17:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 851 transitions. [2024-10-12 19:17:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:17:12,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:12,225 INFO L215 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] [2024-10-12 19:17:12,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:17:12,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:12,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash 237943481, now seen corresponding path program 1 times [2024-10-12 19:17:12,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:12,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78535662] [2024-10-12 19:17:12,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:12,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:12,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:17:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:12,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:12,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:12,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:12,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78535662] [2024-10-12 19:17:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78535662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:12,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:12,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:12,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613643724] [2024-10-12 19:17:12,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:12,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:12,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:12,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:12,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:12,653 INFO L87 Difference]: Start difference. First operand 521 states and 851 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) [2024-10-12 19:17:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:16,376 INFO L93 Difference]: Finished difference Result 1156 states and 1933 transitions. [2024-10-12 19:17:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:17:16,377 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 [2024-10-12 19:17:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:16,380 INFO L225 Difference]: With dead ends: 1156 [2024-10-12 19:17:16,380 INFO L226 Difference]: Without dead ends: 698 [2024-10-12 19:17:16,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:17:16,381 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1109 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 4410 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 4665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 4410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:16,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1862 Invalid, 4665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 4410 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:17:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-12 19:17:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 525. [2024-10-12 19:17:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.645631067961165) internal successors, (678), 433 states have internal predecessors, (678), 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) [2024-10-12 19:17:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 855 transitions. [2024-10-12 19:17:16,436 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 855 transitions. Word has length 57 [2024-10-12 19:17:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:16,436 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 855 transitions. [2024-10-12 19:17:16,436 INFO L472 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) [2024-10-12 19:17:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 855 transitions. [2024-10-12 19:17:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:17:16,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:16,437 INFO L215 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] [2024-10-12 19:17:16,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:17:16,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:16,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash 603873082, now seen corresponding path program 1 times [2024-10-12 19:17:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462544290] [2024-10-12 19:17:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:16,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:17:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:16,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:16,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462544290] [2024-10-12 19:17:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462544290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:16,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:16,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389041851] [2024-10-12 19:17:16,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:16,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:16,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:16,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:16,818 INFO L87 Difference]: Start difference. First operand 525 states and 855 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) [2024-10-12 19:17:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:19,694 INFO L93 Difference]: Finished difference Result 1203 states and 1990 transitions. [2024-10-12 19:17:19,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:19,695 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 [2024-10-12 19:17:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:19,698 INFO L225 Difference]: With dead ends: 1203 [2024-10-12 19:17:19,698 INFO L226 Difference]: Without dead ends: 690 [2024-10-12 19:17:19,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:19,700 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 642 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:19,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1010 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 19:17:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-12 19:17:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 525. [2024-10-12 19:17:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.6432038834951457) internal successors, (677), 433 states have internal predecessors, (677), 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) [2024-10-12 19:17:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 854 transitions. [2024-10-12 19:17:19,778 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 854 transitions. Word has length 57 [2024-10-12 19:17:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:19,778 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 854 transitions. [2024-10-12 19:17:19,778 INFO L472 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) [2024-10-12 19:17:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 854 transitions. [2024-10-12 19:17:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:17:19,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:19,779 INFO L215 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] [2024-10-12 19:17:19,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:17:19,779 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:19,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1787220379, now seen corresponding path program 1 times [2024-10-12 19:17:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:19,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264464506] [2024-10-12 19:17:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:19,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:19,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:20,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:17:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:20,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264464506] [2024-10-12 19:17:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264464506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:20,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:20,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:20,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971490744] [2024-10-12 19:17:20,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:20,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:20,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:20,196 INFO L87 Difference]: Start difference. First operand 525 states and 854 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), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:17:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:24,372 INFO L93 Difference]: Finished difference Result 1158 states and 1933 transitions. [2024-10-12 19:17:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:17:24,372 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), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2024-10-12 19:17:24,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:24,376 INFO L225 Difference]: With dead ends: 1158 [2024-10-12 19:17:24,376 INFO L226 Difference]: Without dead ends: 680 [2024-10-12 19:17:24,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:17:24,378 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 694 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 4540 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 4660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 4540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:24,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1897 Invalid, 4660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 4540 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:17:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-12 19:17:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 517. [2024-10-12 19:17:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 404 states have (on average 1.6485148514851484) internal successors, (666), 425 states have internal predecessors, (666), 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) [2024-10-12 19:17:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 843 transitions. [2024-10-12 19:17:24,434 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 843 transitions. Word has length 57 [2024-10-12 19:17:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:24,434 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 843 transitions. [2024-10-12 19:17:24,434 INFO L472 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), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:17:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 843 transitions. [2024-10-12 19:17:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:17:24,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:24,435 INFO L215 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] [2024-10-12 19:17:24,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:17:24,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:24,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1390361270, now seen corresponding path program 1 times [2024-10-12 19:17:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:24,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210048690] [2024-10-12 19:17:24,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:17:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:24,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210048690] [2024-10-12 19:17:24,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210048690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:24,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:24,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:17:24,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264069255] [2024-10-12 19:17:24,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:24,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:17:24,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:24,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:17:24,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:17:24,836 INFO L87 Difference]: Start difference. First operand 517 states and 843 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) [2024-10-12 19:17:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:28,602 INFO L93 Difference]: Finished difference Result 1148 states and 1917 transitions. [2024-10-12 19:17:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:17:28,603 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 [2024-10-12 19:17:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:28,606 INFO L225 Difference]: With dead ends: 1148 [2024-10-12 19:17:28,606 INFO L226 Difference]: Without dead ends: 690 [2024-10-12 19:17:28,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:17:28,608 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1081 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 4334 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 4591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 4334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:28,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1837 Invalid, 4591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 4334 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:17:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-12 19:17:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 522. [2024-10-12 19:17:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 409 states have (on average 1.6405867970660146) internal successors, (671), 430 states have internal predecessors, (671), 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) [2024-10-12 19:17:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 848 transitions. [2024-10-12 19:17:28,684 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 848 transitions. Word has length 58 [2024-10-12 19:17:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:28,684 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 848 transitions. [2024-10-12 19:17:28,684 INFO L472 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) [2024-10-12 19:17:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 848 transitions. [2024-10-12 19:17:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:17:28,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:28,685 INFO L215 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] [2024-10-12 19:17:28,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:17:28,686 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:28,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:28,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1224183961, now seen corresponding path program 1 times [2024-10-12 19:17:28,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:28,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267731484] [2024-10-12 19:17:28,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:28,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:28,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:17:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267731484] [2024-10-12 19:17:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267731484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:29,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:29,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000958753] [2024-10-12 19:17:29,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:29,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:29,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:29,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:29,043 INFO L87 Difference]: Start difference. First operand 522 states and 848 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) [2024-10-12 19:17:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:31,888 INFO L93 Difference]: Finished difference Result 1158 states and 1926 transitions. [2024-10-12 19:17:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:17:31,889 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 [2024-10-12 19:17:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:31,892 INFO L225 Difference]: With dead ends: 1158 [2024-10-12 19:17:31,892 INFO L226 Difference]: Without dead ends: 680 [2024-10-12 19:17:31,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:31,894 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 677 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:31,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1038 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:17:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-12 19:17:31,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 522. [2024-10-12 19:17:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 409 states have (on average 1.63080684596577) internal successors, (667), 430 states have internal predecessors, (667), 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) [2024-10-12 19:17:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 844 transitions. [2024-10-12 19:17:31,954 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 844 transitions. Word has length 59 [2024-10-12 19:17:31,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:31,954 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 844 transitions. [2024-10-12 19:17:31,954 INFO L472 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) [2024-10-12 19:17:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 844 transitions. [2024-10-12 19:17:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:17:31,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:31,955 INFO L215 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] [2024-10-12 19:17:31,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:17:31,955 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:31,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash -380178459, now seen corresponding path program 1 times [2024-10-12 19:17:31,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:31,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412199744] [2024-10-12 19:17:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:17:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412199744] [2024-10-12 19:17:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412199744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:17:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792224261] [2024-10-12 19:17:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:32,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:17:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:32,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:17:32,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:32,456 INFO L87 Difference]: Start difference. First operand 522 states and 844 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) [2024-10-12 19:17:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:37,637 INFO L93 Difference]: Finished difference Result 1906 states and 3261 transitions. [2024-10-12 19:17:37,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:17:37,637 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 [2024-10-12 19:17:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:37,644 INFO L225 Difference]: With dead ends: 1906 [2024-10-12 19:17:37,644 INFO L226 Difference]: Without dead ends: 1455 [2024-10-12 19:17:37,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:17:37,645 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 2632 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2714 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:37,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2714 Valid, 1340 Invalid, 3576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 2927 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 19:17:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-10-12 19:17:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 992. [2024-10-12 19:17:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 780 states have (on average 1.6730769230769231) internal successors, (1305), 810 states have internal predecessors, (1305), 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) [2024-10-12 19:17:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1655 transitions. [2024-10-12 19:17:37,772 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1655 transitions. Word has length 59 [2024-10-12 19:17:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:37,772 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1655 transitions. [2024-10-12 19:17:37,773 INFO L472 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) [2024-10-12 19:17:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1655 transitions. [2024-10-12 19:17:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 19:17:37,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:37,774 INFO L215 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] [2024-10-12 19:17:37,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:17:37,775 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:37,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:37,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1343021451, now seen corresponding path program 1 times [2024-10-12 19:17:37,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:37,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593296859] [2024-10-12 19:17:37,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:37,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:17:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:17:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:17:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:17:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:38,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:38,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593296859] [2024-10-12 19:17:38,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593296859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:38,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 19:17:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208766574] [2024-10-12 19:17:38,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:38,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:17:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:38,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:17:38,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:17:38,623 INFO L87 Difference]: Start difference. First operand 992 states and 1655 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 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) [2024-10-12 19:17:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:44,442 INFO L93 Difference]: Finished difference Result 2862 states and 4957 transitions. [2024-10-12 19:17:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 19:17:44,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 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 87 [2024-10-12 19:17:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:44,451 INFO L225 Difference]: With dead ends: 2862 [2024-10-12 19:17:44,451 INFO L226 Difference]: Without dead ends: 1942 [2024-10-12 19:17:44,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:17:44,454 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 2824 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 4539 mSolverCounterSat, 1001 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2867 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 5540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1001 IncrementalHoareTripleChecker+Valid, 4539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:44,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2867 Valid, 2073 Invalid, 5540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1001 Valid, 4539 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-12 19:17:44,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2024-10-12 19:17:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1381. [2024-10-12 19:17:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1076 states have (on average 1.6514869888475836) internal successors, (1777), 1110 states have internal predecessors, (1777), 247 states have call successors, (247), 47 states have call predecessors, (247), 57 states have return successors, (287), 234 states have call predecessors, (287), 242 states have call successors, (287) [2024-10-12 19:17:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2311 transitions. [2024-10-12 19:17:44,679 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2311 transitions. Word has length 87 [2024-10-12 19:17:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:44,679 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 2311 transitions. [2024-10-12 19:17:44,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 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) [2024-10-12 19:17:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2311 transitions. [2024-10-12 19:17:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 19:17:44,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:44,682 INFO L215 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] [2024-10-12 19:17:44,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:17:44,682 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:44,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1660264525, now seen corresponding path program 1 times [2024-10-12 19:17:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188978620] [2024-10-12 19:17:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:44,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:17:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:17:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:17:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:17:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:45,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:45,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188978620] [2024-10-12 19:17:45,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188978620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:17:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336348168] [2024-10-12 19:17:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:45,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:17:45,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:17:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:17:45,441 INFO L87 Difference]: Start difference. First operand 1381 states and 2311 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 5 states have internal predecessors, (70), 4 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-12 19:17:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:51,602 INFO L93 Difference]: Finished difference Result 3258 states and 5616 transitions. [2024-10-12 19:17:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:17:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 5 states have internal predecessors, (70), 4 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 91 [2024-10-12 19:17:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:51,611 INFO L225 Difference]: With dead ends: 3258 [2024-10-12 19:17:51,611 INFO L226 Difference]: Without dead ends: 1950 [2024-10-12 19:17:51,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:17:51,616 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 2320 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 4074 mSolverCounterSat, 797 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 4871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 797 IncrementalHoareTripleChecker+Valid, 4074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:51,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 1818 Invalid, 4871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [797 Valid, 4074 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 19:17:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-10-12 19:17:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1389. [2024-10-12 19:17:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1084 states have (on average 1.646678966789668) internal successors, (1785), 1118 states have internal predecessors, (1785), 247 states have call successors, (247), 47 states have call predecessors, (247), 57 states have return successors, (287), 234 states have call predecessors, (287), 242 states have call successors, (287) [2024-10-12 19:17:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2319 transitions. [2024-10-12 19:17:51,853 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2319 transitions. Word has length 91 [2024-10-12 19:17:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:51,853 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 2319 transitions. [2024-10-12 19:17:51,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 5 states have internal predecessors, (70), 4 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-12 19:17:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2319 transitions. [2024-10-12 19:17:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 19:17:51,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:51,855 INFO L215 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] [2024-10-12 19:17:51,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:17:51,856 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:51,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash 604904585, now seen corresponding path program 1 times [2024-10-12 19:17:51,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:51,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053269434] [2024-10-12 19:17:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:51,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:17:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:17:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:17:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:17:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:52,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:52,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053269434] [2024-10-12 19:17:52,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053269434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:52,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:52,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-12 19:17:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784289714] [2024-10-12 19:17:52,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 19:17:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:52,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 19:17:52,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:17:52,627 INFO L87 Difference]: Start difference. First operand 1389 states and 2319 transitions. Second operand has 16 states, 13 states have (on average 5.615384615384615) internal successors, (73), 10 states have internal predecessors, (73), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10)