./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_spec3_product26.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_spec3_product26.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 64b60b46be25872d2112a950c23ddbe99bccee21bea4e463fd90753650d2a7bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:19:30,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:19:30,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:19:30,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:19:30,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:19:30,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:19:30,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:19:30,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:19:30,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:19:30,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:19:30,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:19:30,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:19:30,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:19:30,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:19:30,462 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:19:30,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:19:30,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:19:30,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:19:30,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:19:30,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:19:30,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:19:30,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:19:30,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:19:30,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:19:30,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:19:30,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:19:30,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:19:30,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:19:30,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:19:30,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:19:30,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:19:30,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:19:30,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:19:30,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:19:30,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:19:30,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:19:30,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:19:30,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:19:30,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:19:30,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:19:30,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:19:30,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:19:30,473 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 -> 64b60b46be25872d2112a950c23ddbe99bccee21bea4e463fd90753650d2a7bd [2024-10-12 19:19:30,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:19:30,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:19:30,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:19:30,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:19:30,726 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:19:30,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product26.cil.c [2024-10-12 19:19:32,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:19:32,412 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:19:32,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product26.cil.c [2024-10-12 19:19:32,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e1297ec/0eea9138c26d4b319b5a95d43ea72136/FLAG22de6616a [2024-10-12 19:19:32,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e1297ec/0eea9138c26d4b319b5a95d43ea72136 [2024-10-12 19:19:32,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:19:32,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:19:32,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:19:32,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:19:32,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:19:32,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:19:32" (1/1) ... [2024-10-12 19:19:32,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392f884b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:32, skipping insertion in model container [2024-10-12 19:19:32,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:19:32" (1/1) ... [2024-10-12 19:19:32,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:19:33,349 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_spec3_product26.cil.c[67702,67715] [2024-10-12 19:19:33,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:19:33,382 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:19:33,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-10-12 19:19:33,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [67] [2024-10-12 19:19:33,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [168] [2024-10-12 19:19:33,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [520] [2024-10-12 19:19:33,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2041] [2024-10-12 19:19:33,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2407] [2024-10-12 19:19:33,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3068] [2024-10-12 19:19:33,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3186] [2024-10-12 19:19:33,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3195] [2024-10-12 19:19:33,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [3230] [2024-10-12 19:19:33,588 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_spec3_product26.cil.c[67702,67715] [2024-10-12 19:19:33,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:19:33,623 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:19:33,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33 WrapperNode [2024-10-12 19:19:33,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:19:33,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:19:33,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:19:33,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:19:33,632 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:19:33" (1/1) ... [2024-10-12 19:19:33,670 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:19:33" (1/1) ... [2024-10-12 19:19:33,729 INFO L138 Inliner]: procedures = 91, calls = 346, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 862 [2024-10-12 19:19:33,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:19:33,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:19:33,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:19:33,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:19:33,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,799 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:19:33,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:19:33,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:19:33,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:19:33,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:19:33,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (1/1) ... [2024-10-12 19:19:33,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:19:33,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:19:33,918 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:19:33,921 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:19:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:19:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-12 19:19:33,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-12 19:19:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:19:33,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:19:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:19:33,969 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:19:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:19:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:19:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-12 19:19:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-12 19:19:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:19:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:19:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:19:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:19:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:19:33,973 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:19:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:19:33,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:19:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:19:33,973 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:19:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:19:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:19:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:19:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:19:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-12 19:19:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-12 19:19:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:19:33,975 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:19:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-12 19:19:33,975 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-12 19:19:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:19:33,975 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:19:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2024-10-12 19:19:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2024-10-12 19:19:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:19:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:19:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:19:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:19:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:19:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:19:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:19:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:19:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:19:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:19:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:19:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:19:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:19:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:19:33,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:19:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:19:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-12 19:19:33,980 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-12 19:19:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:19:33,980 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:19:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:19:33,981 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:19:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:19:33,981 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:19:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:19:33,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:19:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:19:33,982 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:19:34,175 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:19:34,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:19:35,421 INFO L? ?]: Removed 451 outVars from TransFormulas that were not future-live. [2024-10-12 19:19:35,421 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:19:35,528 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:19:35,528 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:19:35,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:19:35 BoogieIcfgContainer [2024-10-12 19:19:35,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:19:35,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:19:35,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:19:35,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:19:35,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:19:32" (1/3) ... [2024-10-12 19:19:35,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b6b555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:19:35, skipping insertion in model container [2024-10-12 19:19:35,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:19:33" (2/3) ... [2024-10-12 19:19:35,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b6b555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:19:35, skipping insertion in model container [2024-10-12 19:19:35,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:19:35" (3/3) ... [2024-10-12 19:19:35,538 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product26.cil.c [2024-10-12 19:19:35,553 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:19:35,554 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:19:35,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:19:35,650 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;@55e52f55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:19:35,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:19:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 556 states, 427 states have (on average 1.721311475409836) internal successors, (735), 447 states have internal predecessors, (735), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-12 19:19:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:19:35,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:35,674 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:35,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:35,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1610879925, now seen corresponding path program 1 times [2024-10-12 19:19:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:35,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268485735] [2024-10-12 19:19:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:35,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:19:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:19:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:36,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268485735] [2024-10-12 19:19:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268485735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:36,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:19:36,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576242569] [2024-10-12 19:19:36,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:36,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:19:36,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:19:37,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:19:37,008 INFO L87 Difference]: Start difference. First operand has 556 states, 427 states have (on average 1.721311475409836) internal successors, (735), 447 states have internal predecessors, (735), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:19:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:44,459 INFO L93 Difference]: Finished difference Result 1387 states and 2433 transitions. [2024-10-12 19:19:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:19:44,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2024-10-12 19:19:44,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:44,483 INFO L225 Difference]: With dead ends: 1387 [2024-10-12 19:19:44,484 INFO L226 Difference]: Without dead ends: 832 [2024-10-12 19:19:44,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:19:44,500 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 1443 mSDsluCounter, 2046 mSDsCounter, 0 mSdLazyCounter, 5122 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 5512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 5122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:44,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 2465 Invalid, 5512 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [390 Valid, 5122 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-12 19:19:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-12 19:19:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 562. [2024-10-12 19:19:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 433 states have (on average 1.7066974595842956) internal successors, (739), 453 states have internal predecessors, (739), 103 states have call successors, (103), 25 states have call predecessors, (103), 25 states have return successors, (102), 97 states have call predecessors, (102), 100 states have call successors, (102) [2024-10-12 19:19:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 944 transitions. [2024-10-12 19:19:44,766 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 944 transitions. Word has length 52 [2024-10-12 19:19:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:44,767 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 944 transitions. [2024-10-12 19:19:44,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:19:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 944 transitions. [2024-10-12 19:19:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:19:44,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:44,771 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:19:44,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:44,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -485832071, now seen corresponding path program 1 times [2024-10-12 19:19:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089685418] [2024-10-12 19:19:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:45,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:45,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:45,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:45,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:19:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:45,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:19:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:45,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:45,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089685418] [2024-10-12 19:19:45,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089685418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:45,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:45,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:19:45,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942868454] [2024-10-12 19:19:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:45,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:19:45,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:45,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:19:45,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:19:45,431 INFO L87 Difference]: Start difference. First operand 562 states and 944 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:19:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:51,633 INFO L93 Difference]: Finished difference Result 1384 states and 2400 transitions. [2024-10-12 19:19:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:19:51,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2024-10-12 19:19:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:51,641 INFO L225 Difference]: With dead ends: 1384 [2024-10-12 19:19:51,642 INFO L226 Difference]: Without dead ends: 832 [2024-10-12 19:19:51,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:19:51,646 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 851 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 5150 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 5352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 5150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:51,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 2057 Invalid, 5352 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [202 Valid, 5150 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-12 19:19:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-12 19:19:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 562. [2024-10-12 19:19:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 433 states have (on average 1.7043879907621247) internal successors, (738), 453 states have internal predecessors, (738), 103 states have call successors, (103), 25 states have call predecessors, (103), 25 states have return successors, (102), 97 states have call predecessors, (102), 100 states have call successors, (102) [2024-10-12 19:19:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 943 transitions. [2024-10-12 19:19:51,782 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 943 transitions. Word has length 53 [2024-10-12 19:19:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:51,782 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 943 transitions. [2024-10-12 19:19:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:19:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 943 transitions. [2024-10-12 19:19:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:19:51,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:51,785 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:19:51,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:51,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1166356715, now seen corresponding path program 1 times [2024-10-12 19:19:51,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:51,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731924109] [2024-10-12 19:19:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:19:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:19:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:52,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:19:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:52,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:52,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731924109] [2024-10-12 19:19:52,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731924109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:52,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:52,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:19:52,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133634362] [2024-10-12 19:19:52,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:52,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:19:52,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:52,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:19:52,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:19:52,297 INFO L87 Difference]: Start difference. First operand 562 states and 943 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, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:19:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:56,939 INFO L93 Difference]: Finished difference Result 1378 states and 2383 transitions. [2024-10-12 19:19:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:19:56,939 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, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-12 19:19:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:56,946 INFO L225 Difference]: With dead ends: 1378 [2024-10-12 19:19:56,946 INFO L226 Difference]: Without dead ends: 797 [2024-10-12 19:19:56,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:19:56,950 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 1387 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:56,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1169 Invalid, 3035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-12 19:19:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-12 19:19:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 539. [2024-10-12 19:19:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 413 states have (on average 1.694915254237288) internal successors, (700), 431 states have internal predecessors, (700), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:19:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 901 transitions. [2024-10-12 19:19:57,056 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 901 transitions. Word has length 53 [2024-10-12 19:19:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:57,058 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 901 transitions. [2024-10-12 19:19:57,061 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, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:19:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 901 transitions. [2024-10-12 19:19:57,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 19:19:57,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:57,063 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:57,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:19:57,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:57,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash -834773185, now seen corresponding path program 1 times [2024-10-12 19:19:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445609022] [2024-10-12 19:19:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:19:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:19:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:57,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:57,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445609022] [2024-10-12 19:19:57,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445609022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:57,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:57,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:19:57,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35952584] [2024-10-12 19:19:57,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:57,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:19:57,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:57,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:19:57,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:19:57,698 INFO L87 Difference]: Start difference. First operand 539 states and 901 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:03,279 INFO L93 Difference]: Finished difference Result 1342 states and 2315 transitions. [2024-10-12 19:20:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:20:03,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2024-10-12 19:20:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:03,286 INFO L225 Difference]: With dead ends: 1342 [2024-10-12 19:20:03,286 INFO L226 Difference]: Without dead ends: 791 [2024-10-12 19:20:03,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:20:03,290 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1372 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 4918 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 5298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 4918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:03,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 2411 Invalid, 5298 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [380 Valid, 4918 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:20:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-12 19:20:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 533. [2024-10-12 19:20:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 407 states have (on average 1.6879606879606879) internal successors, (687), 425 states have internal predecessors, (687), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:20:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 888 transitions. [2024-10-12 19:20:03,379 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 888 transitions. Word has length 54 [2024-10-12 19:20:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:03,381 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 888 transitions. [2024-10-12 19:20:03,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 888 transitions. [2024-10-12 19:20:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 19:20:03,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:03,383 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:03,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:20:03,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:03,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash 996465169, now seen corresponding path program 1 times [2024-10-12 19:20:03,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:03,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314448260] [2024-10-12 19:20:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:20:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:20:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:20:04,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314448260] [2024-10-12 19:20:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314448260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:04,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:20:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:20:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470629380] [2024-10-12 19:20:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:20:04,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:04,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:20:04,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:04,004 INFO L87 Difference]: Start difference. First operand 533 states and 888 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:09,002 INFO L93 Difference]: Finished difference Result 1314 states and 2266 transitions. [2024-10-12 19:20:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:20:09,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2024-10-12 19:20:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:09,008 INFO L225 Difference]: With dead ends: 1314 [2024-10-12 19:20:09,009 INFO L226 Difference]: Without dead ends: 791 [2024-10-12 19:20:09,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:20:09,012 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1366 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 4772 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 5176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 4772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:09,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 2082 Invalid, 5176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 4772 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-12 19:20:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-12 19:20:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 533. [2024-10-12 19:20:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 407 states have (on average 1.6855036855036856) internal successors, (686), 425 states have internal predecessors, (686), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:20:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 887 transitions. [2024-10-12 19:20:09,097 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 887 transitions. Word has length 55 [2024-10-12 19:20:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:09,097 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 887 transitions. [2024-10-12 19:20:09,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 887 transitions. [2024-10-12 19:20:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:20:09,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:09,099 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:20:09,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:09,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2071618366, now seen corresponding path program 1 times [2024-10-12 19:20:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:09,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243444482] [2024-10-12 19:20:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:09,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:09,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:09,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:09,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:09,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:20:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:20:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:20:09,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:09,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243444482] [2024-10-12 19:20:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243444482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:09,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:20:09,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:20:09,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072354716] [2024-10-12 19:20:09,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:09,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:20:09,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:09,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:20:09,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:09,700 INFO L87 Difference]: Start difference. First operand 533 states and 887 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:15,432 INFO L93 Difference]: Finished difference Result 1330 states and 2284 transitions. [2024-10-12 19:20:15,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:20:15,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2024-10-12 19:20:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:15,438 INFO L225 Difference]: With dead ends: 1330 [2024-10-12 19:20:15,438 INFO L226 Difference]: Without dead ends: 785 [2024-10-12 19:20:15,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:20:15,442 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 822 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 5034 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 2527 SdHoareTripleChecker+Invalid, 5217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 5034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:15,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 2527 Invalid, 5217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 5034 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-12 19:20:15,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-12 19:20:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 527. [2024-10-12 19:20:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 401 states have (on average 1.6783042394014962) internal successors, (673), 419 states have internal predecessors, (673), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:20:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 874 transitions. [2024-10-12 19:20:15,534 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 874 transitions. Word has length 56 [2024-10-12 19:20:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:15,535 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 874 transitions. [2024-10-12 19:20:15,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 874 transitions. [2024-10-12 19:20:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:20:15,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:15,537 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:20:15,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:15,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash -630177936, now seen corresponding path program 1 times [2024-10-12 19:20:15,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:15,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786924224] [2024-10-12 19:20:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:15,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:16,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:20:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:20:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:20:16,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:16,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786924224] [2024-10-12 19:20:16,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786924224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:16,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:20:16,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:20:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990172039] [2024-10-12 19:20:16,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:16,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:20:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:16,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:20:16,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:16,102 INFO L87 Difference]: Start difference. First operand 527 states and 874 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:21,329 INFO L93 Difference]: Finished difference Result 1302 states and 2237 transitions. [2024-10-12 19:20:21,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:20:21,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 19:20:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:21,335 INFO L225 Difference]: With dead ends: 1302 [2024-10-12 19:20:21,336 INFO L226 Difference]: Without dead ends: 785 [2024-10-12 19:20:21,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:20:21,339 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 785 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 4931 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 2470 SdHoareTripleChecker+Invalid, 5115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 4931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:21,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 2470 Invalid, 5115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 4931 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:20:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-12 19:20:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 527. [2024-10-12 19:20:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 401 states have (on average 1.6758104738154613) internal successors, (672), 419 states have internal predecessors, (672), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:20:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 873 transitions. [2024-10-12 19:20:21,430 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 873 transitions. Word has length 57 [2024-10-12 19:20:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:21,430 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 873 transitions. [2024-10-12 19:20:21,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 873 transitions. [2024-10-12 19:20:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:20:21,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:21,431 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:21,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:20:21,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:21,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash -901366434, now seen corresponding path program 1 times [2024-10-12 19:20:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:21,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142510981] [2024-10-12 19:20:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:21,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:21,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:21,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:20:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:21,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:20:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:20:21,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:21,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142510981] [2024-10-12 19:20:21,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142510981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:21,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:20:21,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:20:21,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423310215] [2024-10-12 19:20:21,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:21,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:20:21,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:21,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:20:21,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:21,953 INFO L87 Difference]: Start difference. First operand 527 states and 873 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:27,425 INFO L93 Difference]: Finished difference Result 1318 states and 2253 transitions. [2024-10-12 19:20:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:20:27,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-12 19:20:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:27,432 INFO L225 Difference]: With dead ends: 1318 [2024-10-12 19:20:27,432 INFO L226 Difference]: Without dead ends: 779 [2024-10-12 19:20:27,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:20:27,435 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 799 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 4815 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 5011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 4815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:27,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 2131 Invalid, 5011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 4815 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:20:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-12 19:20:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 521. [2024-10-12 19:20:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 395 states have (on average 1.6683544303797468) internal successors, (659), 413 states have internal predecessors, (659), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:20:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 860 transitions. [2024-10-12 19:20:27,547 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 860 transitions. Word has length 58 [2024-10-12 19:20:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:27,548 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 860 transitions. [2024-10-12 19:20:27,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 860 transitions. [2024-10-12 19:20:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:20:27,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:27,549 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:20:27,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:27,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1246622047, now seen corresponding path program 1 times [2024-10-12 19:20:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:27,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124255941] [2024-10-12 19:20:27,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:27,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:27,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:28,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:20:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:20:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:20:28,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:28,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124255941] [2024-10-12 19:20:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124255941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:28,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:20:28,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:20:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954338025] [2024-10-12 19:20:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:28,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:20:28,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:20:28,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:28,085 INFO L87 Difference]: Start difference. First operand 521 states and 860 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:33,358 INFO L93 Difference]: Finished difference Result 1290 states and 2208 transitions. [2024-10-12 19:20:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:20:33,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-12 19:20:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:33,363 INFO L225 Difference]: With dead ends: 1290 [2024-10-12 19:20:33,363 INFO L226 Difference]: Without dead ends: 779 [2024-10-12 19:20:33,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:20:33,365 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 765 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 4683 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 4879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 4683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:33,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 2088 Invalid, 4879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 4683 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-12 19:20:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-12 19:20:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 521. [2024-10-12 19:20:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 395 states have (on average 1.6658227848101266) internal successors, (658), 413 states have internal predecessors, (658), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:20:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 859 transitions. [2024-10-12 19:20:33,479 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 859 transitions. Word has length 58 [2024-10-12 19:20:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:33,479 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 859 transitions. [2024-10-12 19:20:33,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 859 transitions. [2024-10-12 19:20:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:20:33,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:33,480 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:20:33,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:33,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:33,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1501438826, now seen corresponding path program 1 times [2024-10-12 19:20:33,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:33,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862697171] [2024-10-12 19:20:33,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:33,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:33,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:33,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:33,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:33,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:20:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:20:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:20:33,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862697171] [2024-10-12 19:20:33,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862697171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:33,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:20:33,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:20:33,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272379571] [2024-10-12 19:20:33,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:33,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:20:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:33,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:20:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:20:33,976 INFO L87 Difference]: Start difference. First operand 521 states and 859 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, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:20:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:38,105 INFO L93 Difference]: Finished difference Result 1296 states and 2212 transitions. [2024-10-12 19:20:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:20:38,105 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, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-12 19:20:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:38,109 INFO L225 Difference]: With dead ends: 1296 [2024-10-12 19:20:38,109 INFO L226 Difference]: Without dead ends: 785 [2024-10-12 19:20:38,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:20:38,111 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 755 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:38,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1167 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-12 19:20:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-12 19:20:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 527. [2024-10-12 19:20:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 401 states have (on average 1.655860349127182) internal successors, (664), 419 states have internal predecessors, (664), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:20:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 865 transitions. [2024-10-12 19:20:38,204 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 865 transitions. Word has length 59 [2024-10-12 19:20:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:38,204 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 865 transitions. [2024-10-12 19:20:38,205 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, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:20:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 865 transitions. [2024-10-12 19:20:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:20:38,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:38,206 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:20:38,206 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:38,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1524071080, now seen corresponding path program 1 times [2024-10-12 19:20:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243825948] [2024-10-12 19:20:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:38,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:38,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:38,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:38,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:38,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:20:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:20:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:20:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243825948] [2024-10-12 19:20:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243825948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:38,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:20:38,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:20:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108287450] [2024-10-12 19:20:38,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:38,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:20:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:38,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:20:38,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:38,757 INFO L87 Difference]: Start difference. First operand 527 states and 865 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:44,091 INFO L93 Difference]: Finished difference Result 1304 states and 2218 transitions. [2024-10-12 19:20:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:20:44,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-12 19:20:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:44,095 INFO L225 Difference]: With dead ends: 1304 [2024-10-12 19:20:44,095 INFO L226 Difference]: Without dead ends: 779 [2024-10-12 19:20:44,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:20:44,097 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 771 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 4781 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 4781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:44,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 2542 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 4781 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-12 19:20:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-12 19:20:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 521. [2024-10-12 19:20:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 395 states have (on average 1.6632911392405063) internal successors, (657), 413 states have internal predecessors, (657), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:20:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 858 transitions. [2024-10-12 19:20:44,219 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 858 transitions. Word has length 59 [2024-10-12 19:20:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:44,220 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 858 transitions. [2024-10-12 19:20:44,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 858 transitions. [2024-10-12 19:20:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:20:44,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:44,221 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:44,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:20:44,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:44,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1698462521, now seen corresponding path program 1 times [2024-10-12 19:20:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083296886] [2024-10-12 19:20:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:44,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:44,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:20:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:44,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:20:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:20:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083296886] [2024-10-12 19:20:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083296886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:20:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977069980] [2024-10-12 19:20:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:44,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:20:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:20:44,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:20:44,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:20:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:44,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:20:44,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:20:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:20:45,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:20:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977069980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:45,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:20:45,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-12 19:20:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072091312] [2024-10-12 19:20:45,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:45,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:20:45,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:20:45,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:45,028 INFO L87 Difference]: Start difference. First operand 521 states and 858 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:45,219 INFO L93 Difference]: Finished difference Result 1488 states and 2477 transitions. [2024-10-12 19:20:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:20:45,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2024-10-12 19:20:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:45,227 INFO L225 Difference]: With dead ends: 1488 [2024-10-12 19:20:45,227 INFO L226 Difference]: Without dead ends: 979 [2024-10-12 19:20:45,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:45,230 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 825 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:45,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1605 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:20:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-12 19:20:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 965. [2024-10-12 19:20:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 740 states have (on average 1.672972972972973) internal successors, (1238), 775 states have internal predecessors, (1238), 180 states have call successors, (180), 45 states have call predecessors, (180), 44 states have return successors, (182), 172 states have call predecessors, (182), 177 states have call successors, (182) [2024-10-12 19:20:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1600 transitions. [2024-10-12 19:20:45,395 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1600 transitions. Word has length 60 [2024-10-12 19:20:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:45,395 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1600 transitions. [2024-10-12 19:20:45,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1600 transitions. [2024-10-12 19:20:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 19:20:45,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:45,397 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:45,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:20:45,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 19:20:45,598 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:45,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1311393664, now seen corresponding path program 1 times [2024-10-12 19:20:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:45,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776676836] [2024-10-12 19:20:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:45,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:46,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:46,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:46,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:46,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:20:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:46,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:20:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:20:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:46,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776676836] [2024-10-12 19:20:46,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776676836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:20:46,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299580260] [2024-10-12 19:20:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:46,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:20:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:20:46,122 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:20:46,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:20:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:46,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:20:46,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:20:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:20:46,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:20:46,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299580260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:46,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:20:46,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-12 19:20:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089686392] [2024-10-12 19:20:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:46,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:20:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:46,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:20:46,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:46,408 INFO L87 Difference]: Start difference. First operand 965 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:46,642 INFO L93 Difference]: Finished difference Result 2376 states and 3963 transitions. [2024-10-12 19:20:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:20:46,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2024-10-12 19:20:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:46,652 INFO L225 Difference]: With dead ends: 2376 [2024-10-12 19:20:46,652 INFO L226 Difference]: Without dead ends: 1423 [2024-10-12 19:20:46,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:20:46,658 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 826 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:46,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1652 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:20:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-10-12 19:20:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1377. [2024-10-12 19:20:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1059 states have (on average 1.684608120868744) internal successors, (1784), 1111 states have internal predecessors, (1784), 255 states have call successors, (255), 62 states have call predecessors, (255), 62 states have return successors, (262), 245 states have call predecessors, (262), 252 states have call successors, (262) [2024-10-12 19:20:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2301 transitions. [2024-10-12 19:20:46,858 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2301 transitions. Word has length 61 [2024-10-12 19:20:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:46,858 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 2301 transitions. [2024-10-12 19:20:46,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:20:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2301 transitions. [2024-10-12 19:20:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 19:20:46,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:46,860 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:46,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:20:47,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 19:20:47,061 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:47,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1357021890, now seen corresponding path program 1 times [2024-10-12 19:20:47,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:47,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032656991] [2024-10-12 19:20:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:47,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:47,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:47,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:20:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:20:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:20:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:20:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032656991] [2024-10-12 19:20:47,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032656991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:47,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:20:47,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:20:47,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507877588] [2024-10-12 19:20:47,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:47,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:20:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:47,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:20:47,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:20:47,519 INFO L87 Difference]: Start difference. First operand 1377 states and 2301 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)